Figure 2 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
Markov chain with state space E = {0, 1, . . . l = 2}. Each state corresponds to the number of distinct nodes that exist in the pool of known nodes of the client, e.g., state 1 means we found 1 out of 2 nodes.
Source publication
Light clients for distributed ledger networks can verify blockchain integrity by downloading and analyzing blockchain headers. They are designed to circumvent the high resource requirements, i.e., the large bandwidth and memory requirements that full nodes must meet, which are unsuitable for consumer-grade hardware and resource-constrained devices....
Contexts in source publication
Context 1
... construct a Markov chain with a state space of size equal to the assumed number of malicious nodes E = {0, 1 . . . l = |S|/2 − 1} (an example is given in Figure 2), where each state corresponds to the number of unique nodes that exist in the pool of known nodes of the client. The transition probabilities of such a chain are derived from the hypergeometric distribution probability mass function: ...
