0xparc / plonkathon Goto Github PK

View Code? Open in Web Editor NEW

149.0 149.0 73.0 36.62 MB

educational python plonk implementation, based on vitalik's py_plonk

Python 100.00%

plonkathon's People

Contributors

Stargazers

Watchers

Forkers

madars emmaguo13 franklynwang topanisto lyronctk divide-by-0 riverruby nealwu iamsahu honeycombi sammymax atheartengineer tideofwords kilyig bkolad ddkang zyklotomic mathieu-chauvin machomaheen immanuelsegol namrapatel talderei tengso oskarth danilowhk gopherj baub55053 rishotics lowlowcoder-mel cyl19970726 alfiezy yz89 yct21 readygo67 zlemon819 paynejoe yidongw luckyyang insomnia501 qizhou lidashu remyjkim zoexss sangoukjeon98 shvier nooma-42 realyee roy105703007 stechu akalmykov riamadide tcoratger masooud6 saurabhchalke nullity00 foodchain1028 sgxninjayh technovision99 timmyjose-forks demian101 aerius-labs punish-yh makluganteng haipro287 manojkgorle draply sampolgar irnb mmurrs tobias-rothmann charmerhub

plonkathon's Issues

Make `k_1 = 2`, `k_2 = 3` top-level constants

k_1, k_2 are quadratic non-residues used to create distinct cosets in the permutation argument. This implementation hard-codes them to k_1 = 2, k_2 = 3; these should be declared as top-level constants.

Basis.MONOMIAL should be Basis.LAGRANGE

plonkathon/poly.py

Lines 161 to 163 in cea88fd

    
           return Polynomial( 
        
               [v * inv_offset**i for (i, v) in enumerate(shifted_coeffs)], 
        
               Basis.LAGRANGE,

Basis.LAGRANGE should be replaced for Basis.MONOMIAL here, as well as including FFT. All-in-all,

return Polynomial(
            [v * inv_offset**i for (i, v) in enumerate(shifted_coeffs)],
            Basis.LAGRANGE,
 )

should be replaced by

return Polynomial(
            [v * inv_offset**i for (i, v) in enumerate(shifted_coeffs)],
            Basis.MONOMIAL,
 ).fft()

Root of unity

Hello,

I don't understand where the number 5 comes from in the root_of_unity function, could you please explain it?

question on the slight different round 1 from paper

I wonder why do the implementation ignore the Z_H in round1 prove

The protocol on paper is as follows

edit:
In MIT plonkathon recording, speaker said Z_H is intend to be omit for simplicity. Round 2 similarly omits k_1 as, below

My question is how to know which to be omit without impact on correctness?

0xparc / plonkathon Goto Github PK

plonkathon's People

Contributors

Stargazers

Watchers

Forkers

plonkathon's Issues

Make `k_1 = 2`, `k_2 = 3` top-level constants

Basis.MONOMIAL should be Basis.LAGRANGE

Root of unity

question on the slight different round 1 from paper

in `main` branch prover round 5, don't hint to FFT expand with offset

stub ec lincomb

Recommend Projects

React

Vue.js

Typescript

TensorFlow

Django

Laravel

D3

Recommend Topics

javascript

web

server

Machine learning

Visualization

Game

Recommend Org

Facebook

Microsoft

Google

Alibaba

D3

Tencent

	return Polynomial(
	[v * inv_offset**i for (i, v) in enumerate(shifted_coeffs)],
	Basis.LAGRANGE,