-
The client has to verify that the prover didn't twiddle their selection of preimages within a bucket. It does so by insuring the prover found the _first_ 2^J_BUCKET_SIZE primages, without skipping ove…
-
We started implementing non-sound continuations in #789. In this Issue, I'd like to collect all steps necessary to make it sound.
### Background:
The main idea is outlined [here](https://hackmd.…
-
This is a quick idea to break up the file, which will greatly increase the speed. At 1 million records it takes 20-30 minutes to completely collapse the merkle tree, necessary for both computing the m…
-
The `Transaction_snark_scan_state.target_merkle_root` function was added in https://github.com/CodaProtocol/coda/pull/3439 to be used in the Sync_ledger code, but the implementation is not efficient. …
-
Start with initial tree state. The initial tree can be fully filled with default values (e.g. hash(NULL)). Then batch update the merkle tree by a list of nodes.
**Public Input**
`[Old Root Hash, …
-
~~Light clients only use rows for sampling~~, and as decided in #577, light clients already know row roots over rows that consist only of tail padding shares.
Therefore, it might be possible to cre…
-
See https://medium.com/@ItsCuzzo/using-merkle-trees-for-nft-whitelists-523b58ada3f9.
1. Construct Merkle tree for whitelist off-chain in Stargaze Tools.
2. Update whitelist contract with the Merkl…
-
It is possible to create infinite merkle root hashes without performing randgen work (8192 items).
Please see more details + source code demonstration
https://github.com/thekingbreaker/pkt-wedgie
…
-
### Problem
State hashing becomes a bottleneck at large scale and high TPS. The bottleneck is due to high disk I/O in `VirtualHasher.hash()` as it reads precomputed hashes along the paths from dirty …
-
# Problem / Overview
StateRoot Manipulation is problem that operator put other data on database deliberately.
For example, let's assume {key: 1, val: 1, key: 2, val: 2, key: 3, val: 3} in DB. whe…