-
Notifications
You must be signed in to change notification settings - Fork 53
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
Experimental VM-based compilation to VampIR #2241
Closed
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Implemented
vampir-vm
target which compiles to a VM run on top of VampIR (the VM is compiled to a circuit, specialized to the particular Juvix program).Juvix/Compiler/VM
) with a parser and an interpreter. Similar to JuvixAsm/JuvixReg, but simpler, more "primitive", and thus easier to write an interpreter for in VampIR.runtime/src/vampir/vm.pir
).Not done and not planned
Conclusion
The approach is to translate to a VM that is compiled into a circuit. This doesn't seem feasible in practice. The efficiency of this solution is prohibitively poor and it's not clear how to substantially improve it.
It seems that zkVMs typically don't execute on circuits. They consist of an optimized executor which executes the program and generates an execution trace. A separate prover then checks and proves the validity of the execution trace, outputting a witness which can be independently verified. Hence, only the validity of the execution trace is subject to proof/verification. The VM is a conventional VM run natively, except that it generates an appropriate execution trace. Encoding a VM into a circuit seems completely infeasible.
See: Building a zkVM application
Possible future work
The JuvixVM language could potentially be used as a basis for an optimized low-level implementation of a VM generating appropriate execution traces.