triton-vm
triton-vm copied to clipboard
TritonVM
Triton is a virtual machine that comes with Algebraic Execution Tables (AET) and Arithmetic Intermediate Representations (AIR) for use in combination with a STARK proof system.
It would be nice to run Triton VM as a command-line tool; Andrew Milson's [demo of ministark](https://github.com/andrewmilson/ministark#demo---proving-brainfk-programs) is a good example; basically one sub-command for proving and dumping something into...
A lot of code in `tasm-lib` creates labels this way: ```rust let entrypoint = self.entrypoint_name(); let code = format!(" {entrypoint}: call {entrypoint}_inner return {entrypoint}_inner: ... ... return ") ``` Which...
Currently, TritonProfiler takes timings from one execution. However, for robust benchmarking it is interesting to see statistics like mean an standard deviation across a larger number of samples.
Recufier
Recursion is the holy grail for SNARKs and STARKs because it unlocks schemes like Incrementally Verifiable Computation (IVC), Proof-Carrying Data (PCD), and proof aggregation. After this threshold, more prover work...
Currently, the constraints are described in 3 places: - in the specification, in human-readable form; - in the specification, in circuit form; - in the code, in circuit form. Downsides:...
Hi! I've been working on a compiler framework for zero-knowledge VMs as a side project. It's called [OmniZK](https://github.com/greenhat/omnizk), and the idea behind it is to help build compilers from high-level...
Checking that two lists are equal up to permutation, also known as [multiset](https://en.wikipedia.org/wiki/Multiset) equality, has many applications. For example, it allows non-deterministic sorting and verifying the result. Another application is...
## Problem In order to `.prove()` and `.verify()` one must currently run `cargo run --bin constraint-evaluation-generator` before `cargo build`. This overwrites some Rust files in `triton-vm/src/` that currently contain stubs...
Currently, the specification specifies the instruction set architecture and how to arithmetize it. However, it assumes the reader is familiar with [BrainSTARK](https://aszepieniec.github.io/stark-brainfuck/) and that this architecture fits into a more...
Initial constraints inherently only apply to the first row of the execution trace. For the Processor Table, some initial constraints are “deactivated” depending on the instruction in that first row...