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.

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

EIP-7594: Add cryptography specs for sampling #3557

Merged
merged 29 commits into from
Jan 15, 2024
Merged
Show file tree
Hide file tree
Changes from 3 commits
Commits
Show all changes
29 commits
Select commit Hold shift + click to select a range
94ecce7
Add polynomial commitments for sampling
dankrad Dec 4, 2023
0d4007a
Apply suggestions from code review
hwwhww Dec 12, 2023
f0af688
Minor fixes
hwwhww Dec 12, 2023
62d1a8f
Add public method markers
dankrad Dec 4, 2023
246477a
SAMPLE -> CELL and cleanups
dankrad Dec 23, 2023
3169f92
More sample -> cell renaming
dankrad Dec 23, 2023
d36fc4f
Zero polynomial -> vanishing polynomial
dankrad Dec 23, 2023
9ec5dde
Remove polynomial_coeff_to_eval
dankrad Dec 23, 2023
c58c4a7
Merge branch 'dev' into polynomial-commitments-sampling
hwwhww Jan 5, 2024
75b1bf5
Add `KZG_SETUP_G1_MONOMIAL` to trusted setup files
hwwhww Jan 5, 2024
5854c7e
Fix some lint errors
hwwhww Jan 5, 2024
7f8858b
Add `PeerDAS` feature
hwwhww Jan 5, 2024
03583b1
Fix fft helper and add basic test
hwwhww Jan 5, 2024
119e00b
Add PeerDAS testing CI job
hwwhww Jan 5, 2024
8fa4ed5
Add `verify_cell_proof_batch` test
hwwhww Jan 5, 2024
9a07270
Rename `recover_cells` to `recover_polynomial` and fix function signa…
hwwhww Jan 8, 2024
db89e29
Clean up Deneb specs. Add some type casting for using fft function
hwwhww Jan 8, 2024
09c2519
Skip pylint check in CI
hwwhww Jan 8, 2024
a58c868
Randomize the test_recover_polynomial()
asn-d6 Jan 9, 2024
5a551a0
Work on hww's round-trip FFT test
asn-d6 Jan 9, 2024
9134cd1
Fix linter
asn-d6 Jan 9, 2024
d21d99f
Add constant for multi cell verification challenge
dankrad Jan 10, 2024
fddbd6b
Remove constants in favour of using compute_roots_of_unity
dankrad Jan 11, 2024
b55ab46
Correct type info for verify_kzg_proof_multi_impl
dankrad Jan 11, 2024
c2522ac
Correct type definition for PolynomialCoeff
dankrad Jan 11, 2024
7ec0a25
Doctoc
dankrad Jan 11, 2024
9a851d9
Linter
dankrad Jan 11, 2024
4cc1e14
Forgot factor of 2 for roots_of_unity_extended
dankrad Jan 12, 2024
b7d9ea9
Rename `peerdas` to `eip7594`
hwwhww Jan 13, 2024
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
3 changes: 2 additions & 1 deletion specs/_features/sharding/polynomial-commitments.md
Original file line number Diff line number Diff line change
Expand Up @@ -58,6 +58,7 @@ This document specifies basic polynomial operations and KZG polynomial commitmen
| `BLS_MODULUS` | `0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001` (curve order of BLS12_381) |
| `PRIMITIVE_ROOT_OF_UNITY` | `7` | Primitive root of unity of the BLS12_381 (inner) BLS_MODULUS |


### KZG Trusted setup

| Name | Value |
Expand Down Expand Up @@ -103,7 +104,7 @@ def reverse_bit_order(n: int, order: int) -> int:
```python
def list_to_reverse_bit_order(l: List[int]) -> List[int]:
"""
Convert a list between normal and reverse bit order. This operation is idempotent.
Convert a list between normal and reverse bit order. The permutation is an involution (inverts itself)..
"""
return [l[reverse_bit_order(i, len(l))] for i in range(len(l))]
```
Expand Down