vacp2p/rfc-index
1
0
Fork 0
mirror of https://github.com/vacp2p/rfc-index.git synced 2026-01-09 22:08:07 -05:00
Code Issues Packages Projects Releases Wiki Activity

Update slot-builder.md

Browse Source
This commit is contained in:
Jimmy Debe
2025-11-14 04:40:13 -05:00
committed by GitHub
parent 99d224b0d6
commit 37ff922fab
1 changed files with 9 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
codex/raw/slot-buIlder.md
View File

@@ -16,7 +16,6 @@ Slots used in the Codex protocol is an important component to node collaboration
The Codex protocol places a dataset into blocks before sending a storage request to the network.
Slots control and facilitates the distrubtion of the data blocks to participating storage providers.
The mechanism builds individual Merkle trees for each slot enabling cell-level proof generation, and
constructs a root verification tree over all slot roots.
@@ -37,7 +36,7 @@ Based on the storage contract, storage providers SHOULD be able to locate a spec
### Contruct the Slot Tree
A slot stores a list of root hashes that aid in the retrieval of a dataset.
A slot stores a list of root hashes that help in the retrieval of a dataset.
The block digest tree SHOULD be contructed before building any slots.
A block is divided into cells that are then hashed and
those hashes are used to create a [Posieden2]() based merkle tree.
@@ -46,10 +45,9 @@ which MAY also be based on the Posiden2 algorithm.
The total byte size of each block MUST be able to evenly divide by the cell size and/or
the number of slots.
### Slot Tree Contruction
Some slots MAY be empty, meaning containing no data,
Some slots MAY be empty,
depending on the size of the dataset.
@@ -70,7 +68,11 @@ type SlotsBuilder*[T, H] = ref object of RootObj
### Verification Tree
A verification tree is a merkle proof based on the `slotRoot`.
Nodes within the network are REQUIRED to verify a dataset before retrieving it.
A verification tree is a merkle proof derived from the `slotRoot`.
The entire dataset is not REQUIRED to contruct the tree.
The following parameters SHOULD be presented:
```nim
@@ -88,12 +90,13 @@ type ProofInputs*[H] = object
```
## Copyright
Copyright and related rights waived via [CC0](https://creativecommons.org/publicdomain/zero/1.0/).
## References
- [CODEX-ERASURE-CODING](./erasure-coding.md)
- [CODEX-ERASURE-CODING](./erasure-coding.md)
-