-
I am curious how the hash for a fuel predicate is computed. As I understand, the predicate hash is computed here: https://github.com/FuelLabs/fuel-vm/blob/2604237c9ff4a755e48b40b2c006711d22cff19f/fuel…
-
### Feature request description/rationale
Currently source seal couples can be used to percolate the less expensive validation of an event that is bound or anchored in some KEL. The two types of eve…
-
When two or more nodes start replicating (i.e. mirroring, syncing) they need to figure out how their files differ, so they can exchange only what they really have to.
The most efficient way to do thi…
-
I receive segmentation fault on assigner call like this:
[Circuit and inputs.zip](https://github.com/NilFoundation/zkllvm-assigner/files/14177288/Circuit.and.inputs.zip)
```
./build/bin/assigne…
-
## Description
The deposit tree is rebuilt from the persisted tree leaves every time for use in the Eth1 caches (once #760 is merged). Rebuilding the deposit tree from scratch for deposit sizes > 1…
-
For `educative mode`, showing the Merkle tree in some way would be nice. 4 digits of each tx hash, with full hash `onHover`. Still would be very wide with 2k tx blocks.
Maybe have the Merkle root exp…
-
btih and ed2k hashes are already supported, so adding this seems legit
implementations of the bittorrent v2 merkle root hash algorithm:
- https://github.com/arvidn/libtorrent - C++
- https:/…
-
A while back I implemented https://github.com/dominictarr/level-merkle
I had been meaning to implement a merkle tree for a while, and wish I had done so sooner. Unfortunately, my experience with [scut…
-
We need to implement merkle trees built from transaction hashes and add the merkle root to each block. This can be used to verify the transactions in a block. This is a fundamental concept of block…
-
As we are building manta (https://github.com/Manta-Network), we figured out that we need an incremental merkle tree that has `Log N` internal nodes, which is not supported in the current MerkleTree im…