-
Notifications
You must be signed in to change notification settings - Fork 33
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
Introduce prove RPC method #1335
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
everything else LGTM
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Why do we need this functionality? It seems pretty risky and not so useful to me tbh.
With the current rpc implementation, anyone can invoke a proving process. If someone is set out to bankrupt us, he can invoke proving the moment they see a sequencer commitment proof in DA, and force us to prove only 1 commitment, causing us a lot of money from both proving and paying fee to DA side.
Even if this problem was to be solved, I can't see the use of this functionality.
UPDATE:
I learned that the prover is not public to the internet. So a random person can not invoke this rpc. But I am still skeptical of this feature as this still relies on the human (us) intervention, and a small mistake can cause a lot. If we want to prove a certain commitment right away without waiting for sampling, it makes more sense to lower the sampling config number and restart the prover for one time.
Also a question, what happens if prover is busy proving a commitment at l1 block 100, but there are commitments at 150 and 200. Someone invoked the commitment at l1 block 200? Do we break the assumption of ordered proofs on DA? If so it might be problematic on the light client and bridge side. |
prove rpc is useful when we do proof sampling and we find some interesting sequencer commitments that we want to prove. So if there is no proof sampling we wont use the RPC |
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
great refactor in the latest commits.
the thing is, that's also something we have to implement :) and it's not worth the time spent on shutting down the prover and restarting etc. having this RPC is really helpful while we still have proof sampling. |
Description
Linked Issues