Skip to content
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

chore: update document #601

Merged
merged 11 commits into from
Dec 5, 2023
Merged

chore: update document #601

Changes from all commits
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
29c852c
Merge branch 'main' into main
Dollyerls Oct 23, 2023
d7d4abb
Merge branch 'main' into main
Dollyerls Oct 23, 2023
1af46bb
chore: Update docs
Dollyerls Oct 23, 2023
fdbcac8
Merge branch 'matter-labs:main' into main
Dollyerls Nov 13, 2023
2841e12
chore: fixed typo
Dollyerls Nov 13, 2023
cf66c15
Merge branch 'matter-labs:main' into main
Dollyerls Nov 19, 2023
eb6f1a0
Merge branch 'main' into main
popzxc Nov 30, 2023
5fce900
Merge branch 'matter-labs:main' into main
Dollyerls Dec 3, 2023
0a156e4
Merge branch 'matter-labs:main' into main
Dollyerls Dec 4, 2023
224b97a
chore(docs): updated bytecode_compression documentation
Dollyerls Dec 4, 2023
635e996
Merge branch 'main' into main
perekopskiy Dec 5, 2023
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
12 changes: 6 additions & 6 deletions docs/advanced/bytecode_compression.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

## Overview

As we are a rollup - all the bytecodes that contracts use in our chain must be copied into L1 (so that the chain can be
As we are a rollup - all the bytecodes that contracts used in our chain must be copied into L1 (so that the chain can be
reconstructed from L1 if needed).

Given the want/need to cutdown on space used, bytecode is compressed prior to being posted to L1. At a high level
Expand Down Expand Up @@ -31,7 +31,7 @@ Dictionary would be:
3 -> 0xC (count: 1)
```

Note that '1' maps to '0xD', as it occurs twice, and first occurrence is earlier than first occurrence of 0xB, that also
Note that '1' maps to '0xD', as it occurs twice, and first occurrence is earlier than first occurence of 0xB, that also
occurs twice.

Compressed bytecode:
Expand Down Expand Up @@ -99,10 +99,10 @@ with no change to the underlying algorithm.
### Verification & Publication

The function `publishCompressBytecode` takes in both the original `_bytecode` and the `_rawCompressedData` , the latter
of which comes from the output of the server’s compression algorithm. Looping over the encoded data, derived from
`_rawCompressedData` , the corresponding chunks are pulled from the dictionary and compared to the original byte code,
reverting if there is a mismatch. After the encoded data has been verified, it is published to L1 and marked accordingly
within the `KnownCodesStorage` contract.
of which comes from the server’s compression algorithm output. Looping over the encoded data, derived from
`_rawCompressedData` , the corresponding chunks are retrieved from the dictionary and compared to the original byte
code, reverting if there is a mismatch. After the encoded data has been verified, it is published to L1 and marked
accordingly within the `KnownCodesStorage` contract.

Pseudo-code implementation:

Expand Down