github/circom-stark

mirror of https://github.com/chancehudson/circom-stark.git synced 2026-01-07 21:13:51 -05:00

Go to file

Chance 8dc35ff5a3 feat: restructure r1cs trace

2023-12-07 12:58:15 -06:00

refactor: switch to goldilocks curve

2023-10-11 16:51:04 -05:00

feat: restructure r1cs trace

2023-12-07 12:58:15 -06:00

feat: restructure r1cs trace

2023-12-07 12:58:15 -06:00

.gitignore

initial commit

2023-09-06 23:58:33 -05:00

package-lock.json

feat: r1cs parsing

2023-10-11 16:51:04 -05:00

package.json

feat: r1cs parsing

2023-10-11 16:51:04 -05:00

README.md

chore: update readme

2023-12-07 11:14:16 -06:00

README.md

circom-stark

A binding to make R1CS proofs using rstark.

About

R1CS proofs are based on sets of constraints of the form A*B - C = 0 where A, B, and C are scalar sums. We can take such a system and reduce it to a single constraint using a random linear combination. This reduces to a STARK proof with trace length 1 and 1 constraint. The proof speed is limited by the total number of variables (aka signals) in the R1CS.