You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Compressed block should contain a merkle root over all compression SMTs. Each registry keyspace will have it's own merkle root capped to 24 bits of depth.
Currently, we simply insert zeroes for the root. When we need fraud proofs, we have to actually compute the merkle root.
The text was updated successfully, but these errors were encountered:
Related #1605. VM PR
FuelLabs/fuel-vm#670.
This PR adds DA compression crate for Fuel blocks, performed upon block
creation. The compressed blocks are stored into the offchain database
and can be fetched using the GraphQL API.
## Note for reviewers
To keep this reasonably compact, decompression support is not included
in this PR, and will be done as a follow-up. As a result, the full data
roundtrip testing is not part of this PR. There's no proof here that
compression of full blocks is reversible.
## TODO
#### Features
- [x] Temporal registry db support
- [x] Optimize temporal registry eviction implementation
- [x] Implement TxId ↔ TxPointer lookups
- [x] Integrate with the block committer (GraphQL interface, probably)
#### Tests
- [x] compressed blocks are available from non-block-producer nodes
- [ ] e2e test for the full decompression cycle (moved to a follow-up)
## Follow-up issues
- Sync the node from L1:
#2208
- Decompression roudntrip tests
#2238
- Figure out which cache eviction algorithm/behavior is wanted:
#2231
- Figure out if we need to remove the compressed blocks from the db
after a while
- Merkle roots for fraud proofs
#2232
---------
Co-authored-by: Aaryamann Challani <[email protected]>
Co-authored-by: Green Baneling <[email protected]>
Co-authored-by: Rafał Chabowski <[email protected]>
Compressed block should contain a merkle root over all compression SMTs. Each registry keyspace will have it's own merkle root capped to 24 bits of depth.
Currently, we simply insert zeroes for the root. When we need fraud proofs, we have to actually compute the merkle root.
The text was updated successfully, but these errors were encountered: