You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Specialised operations, referred to as "nasty" operations internally, describe operations that are too expensive to prove as a combination of other opcodes.
For example, to prove a keccak hash, it would require an extreme number of arithmetic and bitwise operations; leading to a blowup in codesize and prover rows.
These operations can be turned into vm opcodes to solve the code size problem.
Maddiaa0
changed the title
public-vm(ts): VM simulation of nasty operations
public-vm(ts): VM simulation of hash / elliptic curve operations
Jan 12, 2024
dbanks12
changed the title
public-vm(ts): VM simulation of hash / elliptic curve operations
public-vm(simulator): VM simulation of hash / elliptic curve operations
Jan 30, 2024
Overview
Specialised operations, referred to as "nasty" operations internally, describe operations that are too expensive to prove as a combination of other opcodes.
For example, to prove a keccak hash, it would require an extreme number of arithmetic and bitwise operations; leading to a blowup in codesize and prover rows.
These operations can be turned into vm opcodes to solve the code size problem.
In this pr, implement opcodes for:
Links
The text was updated successfully, but these errors were encountered: