Published on: 2021-09-16T15:05:24+00:00
Vincent responded to Shymaa Arafat's message, acknowledging her idea for saving storage space and addressing traversing issues in handling the UTXOS Merkle Tree/forest. Shymaa proposed a solution using a 2D array with variable row size, which eliminates the need for pointers and can be applied to any Merkle Tree. By storing N internal nodes and using the appropriate formula, traversing can be performed efficiently in any direction. Shymaa provided pseudo code for fetching proof[i], which involves transforming recursion into iteration. Vincent expressed gratitude for the reference but requested clarification on the specific area where Shymaa intends to save space through this compression technique on the Merkle Tree.In summary, Shymaa M Arafat introduces a simple yet practical approach to address storage concerns and simplify traversing in the UTXOS Merkle Tree/forest. The method involves utilizing a 2D array with variable row size, eliminating the need for pointers and reducing overall storage requirements. Traversing can be performed smoothly in any direction using the right formula. A pseudo code for fetching proof[i] is provided, offering a recursive-to-iterative transformation. While the Utreexo team may have employed a different solution, Shymaa believes this approach has broader applicability for any Merkle Tree scenario.
Updated on: 2023-07-31T23:46:56.627112+00:00