Bitcoin full node and query server

Nov 4, 2024

View in context in the libbitcoin Slack #general mirror.

evoskuil20:31

Conceptually, this seems close to a MapReduce algorithm, where unordered checks are mapped on to each range, and then the Reduce step requires sequential ordering of each range of blocks for the confirmability checks.

It's an interesting theory, but not really the case. The process much is less discrete, not constrained by "ranges".

Clear separation between un-ordered and fully ordered checks is what makes this possible, from what I can tell. The partially ordered checks are not done under the -assumevalid / milestone model.

This is true, nor are the fully-ordered checks (confirmability). These are entirely unnecessary as the milestone is of course considered a valid block, and the rest is proven by the minimal checks that are performed.