Skip to content

verification: Hashing Refactor to match the updated Merkle tree design (Aug. 2025). #1385

@AlfredoG87

Description

@AlfredoG87

Story Form

As a BN Developer
I want to keep Hashing consistency with CN
So that we implemeent the latest changes to the way we calculate the BlockRoot Hash

Technical Notes

As a result of work to define interledger protocols and state proofs, a number of deficiencies in the current hashing merkle tree were identified.
These include missing references, long path requirements, differentiating internal and leaf hashes, and forward-compatibility.
To address these and related concerns, the construction of the hash tree is to be modified with several wide-ranging changes. Note that these changes only affect the hash calculations for the block proof; they do not change the actual values stored in state or transmitted in the block stream.
We intend to create a modified hash calculation module that implements this updated "merkle mountain" construction process and calculates the root hash result. This module may (perhaps in a future update) optionally cache certain expensive subtree data to limit unnecessary hash recalculation.

Sub-issues

Metadata

Metadata

Assignees

Labels

Block NodeIssues/PR related to the Block Node.ImprovementCode changes driven by non business requirements

Type

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions