Compressed block should contain a merkle root over all compression SMTs. Each registry keyspace will have it's own merkle root capped to 24 bits of depth.
Currently, we simply insert zeroes for the root. When we need fraud proofs, we have to actually compute the merkle root.
Compressed block should contain a merkle root over all compression SMTs. Each registry keyspace will have it's own merkle root capped to 24 bits of depth.
Currently, we simply insert zeroes for the root. When we need fraud proofs, we have to actually compute the merkle root.