#79 Change SMT bit ordering#80
Conversation
There was a problem hiding this comment.
Code Review
This pull request refactors the Sparse Merkle Tree (SMT) and Sparse Merkle Sum Tree implementations, replacing the previous BigInteger-based tree routing with a more efficient byte-array-based routing mechanism. It introduces helper utilities in SparseMerkleTreePathUtils and cleans up unused classes and exceptions. The review feedback highlights several opportunities to improve robustness, specifically by adding input validation for parameters like depth, maxDepth, and key to prevent potential out-of-bounds exceptions, and by explicitly masking byte operations with 0xff in getBitAtDepth to avoid implicit sign extension.
Important
The consumer version of Gemini Code Assist on GitHub is being sunset. Starting June 18, 2026, new organization installations will be blocked, and all code review activity will officially cease on July 17, 2026.
For more details on the timeline and next steps, please review the Help Documentation.
No description provided.