• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Zfc
    • Acre
    • Milawa
    • Smtlink
    • Abnf
    • Vwsim
    • Isar
    • Pfcs
    • Wp-gen
    • Dimacs-reader
    • Legacy-defrstobj
    • Proof-checker-array
    • Soft
    • C
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
    • Java
    • Taspi
    • Riscv
    • Bitcoin
    • Des
    • Ethereum
    • X86isa
    • Sha-2
    • Yul
    • Zcash
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Poseidon
    • Where-do-i-place-my-book
    • Axe
    • Aleo
      • Aleobft
      • Aleovm
        • Circuits
          • Circuits-pfcs
          • Field-div-flagged
          • Boolean-assert-true
          • Field-inv-flagged
          • Boolean-assert
          • Field-div-unchecked
          • Field-neq
          • Boolean-not
          • Boolean-assert-all
          • Boolean-if
          • Field-if
          • Boolean-xor
          • Boolean-or
          • Boolean-nor
          • Boolean-and
          • Boolean-nand
          • Boolean-neq
          • Boolean-eq
          • Boolean-assert-neq
          • Boolean-assert-eq
          • Field-eq
          • Field-div-checked
          • Field-inv-checked
          • Field-assert-neq
          • Field-assert-eq
          • Field-mul
          • Field-sub
          • Field-square
          • Field-neg
          • Field-double
          • Field-add
            • Field-add-spec
            • Field-add-circuit
            • Field-add-correctness
            • Field-add-lifting
        • Language
      • Leo
    • Bigmems
    • Builtins
    • Execloader
    • Solidity
    • Paco
    • Concurrent-programs
    • Bls12-377-curves
  • Debugging
  • Std
  • Community
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Circuits

Field-add

Formalization and verification of a circuit for field addition.

Given two field elements x and y, their sum z is obtained via a constraint of the form

$(x\; +\; y)\; (1)\; =\; (z)$

Subtopics

Field-add-spec

Specification of the circuit.

Field-add-circuit

Construction of the circuit.

Field-add-correctness

Correctness of the circuit.

Field-add-lifting

Lifting of the circuit to a predicate.