kayabaNerve / full-chain-membership-proofs

18 stars 1 forks source link

Minimal divisor transformations #26

Open kayabaNerve opened 1 year ago

kayabaNerve commented 1 year ago

An n-coefficient divisor requires n / 2 gates to be committed to in circuit. Accordingly, minimizing the coefficients minimizes the gates required for it. We should look at x-only divisor representations, or representations using y powers, to minimize the amount of gates required. At the very least, knowledge of how far off optimal the current representation is would be appreciated.