Skip to content

Fix description of stateless compression #1686

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
+4 −2
Open

Fix description of stateless compression #1686

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 4 additions & 2 deletions modules/architecture/pages/data-availability.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -136,8 +136,10 @@ To illustrate the above, consider the following example: Let indices 0,1, …, 5
* Bucket 252: `[2^250]`
* Bucket 83: `[2^63, 2^63+1]`
* Bucket 15: `[10, 100]`
* Pointers: `[0, 5, 5, 3, 3, 6, 6]`
* Repeating value pointers: `[(5, 0), (5, 1)]` (We have two repetitions: the first for 10, which is the first element in bucket index 5, and the second for 100, which is the second element in the same bucket)

The list of unique values is `[2^250, 2^63, 2^63 + 1, 10, 100]`. From this, we construct the last bucket of repeating value pointers: `[3, 4]`. (We have two repetitions: the first for 10, which is the fourth element in the unique values and the second for 100, which is the fifth element in the list.)

Finally, the pointers list is `[0, 5, 5, 3, 3, 6, 6]`.

The final compressed list packs each bucket and each list individually and adds some necessary metadata.

Expand Down