Data source status

In brief How recently a price was observed at its source; a page refresh does not make it current or guarantee it can be traded.

How recent an underlying market observation is, judged from its timestamp and the tool's stated rules. A source event time, collection time and page refresh time describe different things. A recent observation still does not guarantee an available or executable price.

For example Reloading a page at 12:05 does not make an observation from 11:30 newer; that source observation remains 35 minutes old.

Common mistake Reading a cache refresh as a new market event or assuming that every tool uses the same expiry threshold.

In brief The share of a stated window or expected sample represented by usable records, which can still contain errors.

How much of a stated observation window or expected set is represented by usable records. The denominator may be scheduled polls, candle intervals or another declared sample. Coverage describes availability within that scope, not measurement accuracy or a complete view of the network.

For example If 90 of 96 expected price buckets are available, interval coverage is 93.75%; this says nothing about trades hidden inside those buckets.

Common mistake Reading missing observations as zero activity, or treating high coverage as proof that the sample is unbiased and error-free.

In brief A participant running network software; a full node checks rules but need not keep all old block files.

A participant running network software. A full node independently validates rules; a pruned full node can discard older block files after validation. Not every node stores the complete historical blockchain.

For example A pruned full node checks the chain but later discards old block files to reduce disk use.

Common mistake Assuming every node is a miner, or that pruning means it skipped consensus validation.

In brief One node's local collection of accepted but unconfirmed transactions, which may differ from other nodes' collections.

A node's local collection of unconfirmed transactions it currently accepts. Nodes can see, retain or remove different transactions, so there is no single global waiting room. Appearing in a mempool is not confirmation or a guarantee of later inclusion.

For example One explorer may see your unconfirmed transaction while another node has not received it or has already removed it.

Common mistake Assuming that absence from one mempool proves the payment was never broadcast or that a seen transaction must confirm.

In brief The rate of proof-of-work attempts; a network-wide figure is estimated and depends on the calculation method.

The rate of proof-of-work hash attempts, usually expressed per second. Network hash rate is estimated from blocks and difficulty rather than directly counted. Compare figures for the same algorithm; a higher rate alone does not establish decentralization or mining profitability.

For example One PH/s represents one quadrillion hash attempts per second; compare only figures for the relevant mining algorithm.

Common mistake Comparing Litecoin and Bitcoin hash-rate numbers as if Scrypt and SHA-256 work had identical costs.