Maru
  • Introduction
  • Volume use cases
  • Architecture overview
  • Maru Roadmap
  • ZK IMPLEMENTATION
    • Schema
      • Sum proof
      • Search proof
      • Data proof
      • Keccak proof
      • KeccakSponge proof
      • Logic proof
      • Arithmetic proof
    • Plonky2 verifier in Circom
  • user guide
    • Maru Demo FAQ
      • Why event proofs?
      • Why starky?
    • Deployed contracts
  • Maru ZKVM
    • Computer architecture
    • Memory model
    • Instruction set architecture
      • Instructions Execution
      • Instruction set
      • Instruction encoding
    • High-level frontend
    • Domain Specific Language
      • Unary map
      • Zip and binary map
      • Filter for all ETH-USDC swap prices on Uniswap
      • Calculate a 24-hour block-by-block moving average of the ETH-USDC pair on Uniswap
      • Compiler optimizations
Powered by GitBook
On this page
  1. Maru ZKVM
  2. Instruction set architecture

Instructions Execution

Currently we have simple sequential instruction execution, both for it’s simplicity and versatility. By carefully restricting processor state, using write-one memory and staggering memory constraints across several columns, we were able to achieve “one instruction - one row” proof density, disregarding dummy padding rows. We are looking into superscalar execution paradigm to further compress proofs.

PreviousInstruction set architectureNextInstruction set

Last updated 1 year ago