-
Notifications
You must be signed in to change notification settings - Fork 288
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Starky proof failing to verify recursively #1631
Comments
Here's some code snippets :-
Also
|
Hello, |
Here you can find all the relevant codes, also let me know if you want more details, I will add you as a collaborator to the repo. |
Also, I would want to learn more about the constraint degree function used while defining the starky circuits. I have seen many examples where we have used values either 2 or 3, Can you please guide me into the relevance of the constraint degree and if any docs you can share |
Any updates @Nashtare |
I am trying to verify a starky proof inside a plonky2 circuit. I have followed the same procedure as per the FibonacciStark.rs file, but I am getting error :-
I have my custom Starky proof, which can be successfully proved and verified with prove and verify functions but fails during recursive verification.
thread 'dense::tests::test_stark_recursive' panicked at src/dense.rs:115:70:
called
Result::unwrap()
on anErr
value: Partition containing Wire(Wire { row: 53, column: 40 }) was set twice with different values: 5380601374886916272 != 11172169064086565555note: run with
RUST_BACKTRACE=1
environment variable to display a backtracetest dense::tests::test_stark_recursive ... FAILED
The text was updated successfully, but these errors were encountered: