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. ZK IMPLEMENTATION
  2. Schema

Arithmetic proof

PreviousLogic proofNextPlonky2 verifier in Circom

Last updated 1 year ago

Arithmetic proof via zk-STARKs enables efficient verification of addition operation of volume values combined with Sum proof through CTL.

Circuit

Private inputs include data fields about each value:

  • operator flag of arithmetic operator

  • input0 first operand of arithmetic operation

  • input1 second operand of arithmetic operation

  • input2 third operand if we have ternary arithmetic operation

  • result of arithmetic operation

Please refer to the ArithmeticStark description to learn more about how this STARK was implemented and what fields and constraints were used:

155KB
ArithmeticStark.pdf
pdf