Imagine a graph where the leaf nodes are the UTxOs, the intermediate nodes are spent TxOs (vout), the root nodes are the blockheaders and coinbase merklepairs, and the edges are the data required to verify the transition between nodes (i.e. the transactions):
How many nodes and edges would this graph have, as of block 831276?
What would be the longest path through the graph?
Are there any interesting ways to categorise the graph from graph theory? Is it acyclic for example? How many disjoint sub-graphs are there?
What would be the mean/median/range number of leaf-to-root hops through the graph.
Small example sub-graph:
RootNode blockheader coinbase-merklepair (the 32byte number required to prove that the coinbase tx is in the blockheader’s tx_root)
Edge0 coinbasetx
IntermediateNode Vout id from edge0 transaction
Edge1 a transaction (vin id == IntermediateNode and input_txid == edge0)
LeafNode the vout for an unspent output from edge1
Thanks to RedGrittyBrick and Murch for prompting clarification
