Current limitations of Plonky3 support for circuits3

codeblooded1729 commented 10 months ago

[x] Can't use Mersenne-31 or BabyBear fields yet, since they have size smaller than 32 bit.
[x] Update: Since the addition of symbolic builder, this is no longer an issue.
Yet to figure out the analogue of constraint_degree in context of plonky3's uni_stark
[x] Update: fixed in upstream now. Current verifer of uni_stark in plonky3 repo uses some hardcoded values. I have create a branch with temporary hack to solve this issue in our fork of plonky3, and using that branch in circuit3.

We would be using valida prover as an example for our vm. The functionalities which are yet to be implemented in valida as on 22 Jan 2024 are

[x] Computation of quotient polynomial in prover (This is WIP, and supposedly finishes the prover https://github.com/valida-xyz/valida/pull/99)
[ ] Verifier is completely unimplemented. This is expected since the actual prover is incomplete.

jdkanani commented 8 months ago

Who is working on this one? @phildimes @codeblooded1729

matthiasgoergens commented 8 months ago

Is recursion still open? What about verification?

matthiasgoergens commented 8 months ago

@codeblooded1729 I assigned this to you. That doesn't mean you need to fix all the problems, just to keep this list up to date. Thanks!

matthiasgoergens commented 8 months ago

Can't use Mersenne-31 or BabyBear fields yet, since they have size smaller than 32 bit.

We need to see about using multiple limbs for our 32 bit values?

matthiasgoergens commented 8 months ago

0xmozak / mozak-vm