• 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
            • Circuits-r1cs
            • 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
              • Field-if-spec
              • Field-if-correctness
              • Field-if-circuit
              • Field-if-lifting
              • 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
            • 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
    • Field-if

    Field-if-lifting

    Lifting of the circuit to a predicate.

    Definitions and Theorems

    Function: field-if-pred

    (defun field-if-pred (x y z w prime)
     (and
      (equal
        (pfield::mul x
                     (pfield::add y (pfield::mul (mod -1 prime) z prime)
                                  prime)
                     prime)
        (pfield::add w (pfield::mul (mod -1 prime) z prime)
                     prime))))

    Theorem: definition-satp-to-field-if-pred

    (defthm definition-satp-to-field-if-pred
     (implies
      (and
       (equal
          (pfcs::lookup-definition "field_if" pfcs::defs)
          '(:definition
                (pfcs::name . "field_if")
                (pfcs::para "x" "y" "z" "w")
                (pfcs::body
                     (:equal (:mul (:var "x")
                                   (:add (:var "y")
                                         (:mul (:const -1) (:var "z"))))
                             (:add (:var "w")
                                   (:mul (:const -1) (:var "z")))))))
       (pfield::fep x prime)
       (pfield::fep y prime)
       (pfield::fep z prime)
       (pfield::fep w prime)
       (primep prime))
      (equal (pfcs::definition-satp "field_if" pfcs::defs (list x y z w)
                                    prime)
             (field-if-pred x y z w prime))))