-
One of the main balancing acts of FRI in the recursive context is the choice of a hash function to construct the Merkle trees: fast hashes such as Keccak and Blake3 have very large recursive circuits,…
-
@mitchellmanware
We were discussing how prediction locations could be done in grids with no need to merge for a massive dataframe. We could build this grouping into a standardized spatial gridding s…
-
There's a long-standing issue that calculating a `milhouse` tree hash _properly_ requires mutable access to the `List`/`Vector` so that pending updates can be flushed to the underlying binary tree.
…
-
Severity: Medium
Difficulty: High
Type: Cryptography
Target: crates/pessimistic-proof/src/local_exit_tree/mod.rs, crates/pessimistic-proof/src/local_exit_tree/mod.rs
## Description
The local ex…
-
## Current Hashing Approach
Lodestar's architecture relies heavily on maintaining a full merkle tree of
the beacon state. We represent the tree as a linked data structure, where each node is 1. i…
-
#### Problem
When constructing a Merkle Tree using the [solana-merkle-tree](https://github.com/solana-labs/solana/blob/master/merkle-tree/src/merkle_tree.rs) the data is hashed and pushed to the vect…
-
### Component
rpc
### Describe the feature you would like
Generate the tree hash root for the BidTrace. In order to send the Bid to the relayer, the builder has to sign the hash tree root of the Bi…
-
-
### Problem
The tree hashing algorithm describes a hash function for SSZ data structures. For lists and containers, it is defined recursively: First, hash each element and, second, hash the results…
-
Figure out how the Nodes field is used to request specific hashes from the hash tree.
ghost updated
5 years ago