Merkle DAGs

from boltzmann.merkle import LAYOUT_NAME

LAYOUT_NAME
# 'rfc6962-sorted/1'

from boltzmann.merkle import MerkleTree, merkle_root, sorted_leaves

merkle_root([c, a, b]) == merkle_root([a, b, c])   # True -- order does not matter

tree = MerkleTree([a, b, c])
tree.root
tree.name                      # 'rfc6962-sorted/1'
tree.index_of(b)               # position among the sorted leaves
tree.verify()                  # recompute every leaf's proof against the root

proof = brain.prove(block_id, MemoryType.SEMANTIC)

proof.block_id
proof.leaf_index
proof.tree_size
proof.audit_path               # the sibling hashes needed to recompute the root

proof.verify(root)             # -> bool
proof.require(root)            # raises InclusionProofError instead of returning False

from boltzmann.merkle import DEFAULT_LAYOUT, MerkleLayout, SortedRfc6962Layout

class MyLayout:
    @property
    def name(self) -> str: ...
    def root(self, block_ids) -> MerkleRoot: ...
    def inclusion_proof(self, block_ids, target) -> InclusionProof: ...

assert isinstance(MyLayout(), MerkleLayout)

from boltzmann.merkle import diff

d = diff(before_ids, after_ids)

d.before, d.after              # the two roots
d.added, d.removed, d.unchanged
d.transfer_size                # how many blocks a consumer must fetch
d.is_empty                     # whether the two compositions are identical