Issues
- 2
This function in Nova's verifier takes 99% of the time
#106 opened by sga001 - 0
Cheaper eq proof
#102 opened by sga001 - 1
Back-end fine-grained benchmarks
#32 opened by elefthei - 2
Commit to public table too
#104 opened by sga001 - 0
Generalize back-end for any AND node
#105 opened by elefthei - 0
DFA with recursion solver time
#103 opened by sga001 - 2
- 7
Table projections
#70 opened by sga001 - 2
Implement back end for SAFA
#64 opened by sga001 - 6
need to hide running claim evaluation
#62 opened by jkwoods - 0
- 2
Open sets backend
#74 opened by elefthei - 1
Implement baseline
#78 opened by sga001 - 2
Add support for negations into SAFA
#65 opened by sga001 - 1
Regex simplification now explicit
#73 opened by elefthei - 0
Nova has new witness gen
#77 opened by sga001 - 4
Remove unnecessary transitions
#72 opened by sga001 - 0
Make sized strings for NFA
#10 opened by elefthei - 1
Implement Hyrax-PC
#68 opened by sga001 - 0
Extract nlookup
#67 opened by sga001 - 0
See if we can make padding cheaper
#69 opened by sga001 - 1
Zero-cost padding MLE
#66 opened by sga001 - 0
bounded MLE w/linear time proving
#57 opened by jkwoods - 2
Convert everything to jmalloc
#52 opened by ecmargo - 2
Make .* special (slicing)
#28 opened by elefthei - 1
Bounded star algebraic simplification
#59 opened by elefthei - 5
generate both commitments and proof
#54 opened by jkwoods - 3
Fix q bits overflow
#42 opened by ecmargo - 2
Measurement framework in Rust
#24 opened by elefthei - 0
q nlookup ordering checks
#48 opened by jkwoods - 1
Accepting state check failure
#46 opened by ecmargo - 0
- 0
Do something about the million rust warnings
#19 opened by jkwoods - 2
synthesize efficiency
#16 opened by jkwoods - 1
Why this fails
#38 opened by elefthei - 1
Is folding cost wrong?
#41 opened by ecmargo - 0
crypto todos
#17 opened by jkwoods - 4
Padding for batch sizes
#25 opened by jkwoods - 2
Substrings
#18 opened by jkwoods - 1
bounded regex star
#23 opened by jkwoods