• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Community
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
        • Set
        • Soft
        • C
        • Bv
        • Imp-language
        • Event-macros
        • Java
        • Bitcoin
        • Ethereum
        • Yul
        • Zcash
        • ACL2-programming-language
        • Prime-fields
        • Json
        • Syntheto
        • File-io-light
        • Cryptography
          • R1cs
          • Interfaces
          • Sha-2
          • Keccak
          • Kdf
          • Mimc
          • Padding
          • Hmac
          • Elliptic-curves
            • Secp256k1-attachment
            • Twisted-edwards
            • Montgomery
              • Montgomery-mul
              • Montgomery-add
              • Montgomery-point-orderp
              • Montgomery-add-commutativity
              • Montgomery-mul-distributivity-over-scalar-addition
              • Montgomery-add-associativity
              • Birational-montgomery-twisted-edwards
              • Montgomery-curve
                • Montgomery-curve-fix
                • Montgomery-curve-equiv
                • Make-montgomery-curve
                • Montgomery-curvep
                • Change-montgomery-curve
                • Montgomery-curve->b
                  • Montgomery-curve->a
                  • Montgomery-curve->p
                • Montgomery-mul-nonneg
                • Montgomery-not-point-with-x-minus1-when-a-minus-2-over-b-not-square
                • Point-on-montgomery-p
                • Montgomery-neg
                • Montgomery-sub
                • Montgomery-add-closure
                • Montgomery-only-point-with-y-0-when-aa-minus-4-non-square
                • Montgomery-point-order-leastp
                • Montgomery-distinct-x-when-nonzero-mul-in-order-range
                • Montgomery-add-inverse-uniqueness
                • Montgomery-distributivity-of-neg-over-add
                • Montgomery-mul-associativity
                • Montgomery-points-with-same-x-have-same-or-neg-y
                • Montgomery-zero
                • Montgomery-points-with-same-x-are-same-or-neg-point
                • Montgomery-mul-of-mod-order
                • Montgomery-neg-inverse
                • Montgomery-zero-identity
                • Point-on-montgomery-finite-when-not-zero
              • Short-weierstrass-curves
              • Birational-montgomery-twisted-edwards
              • Has-square-root?-satisfies-pfield-squarep
              • Secp256k1
              • Secp256k1-domain-parameters
              • Secp256k1-types
              • Pfield-squarep
              • Secp256k1-interface
              • Prime-field-extra-rules
              • Points
            • Attachments
            • Elliptic-curve-digital-signature-algorithm
          • Number-theory
          • Lists-light
          • Axe
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Montgomery-curve

    Montgomery-curve->b

    Get the b field from a montgomery-curve.

    Signature
    (montgomery-curve->b x) → fty::x.name
    Arguments
    x — Guard (montgomery-curvep x).

    This is an ordinary field accessor created by fty::defprod.

    Definitions and Theorems

    Function: montgomery-curve->b$inline

    (defun montgomery-curve->b$inline (x)
      (declare (xargs :guard (montgomery-curvep x)))
      (declare (xargs :guard t))
      (let ((acl2::__function__ 'montgomery-curve->b))
        (declare (ignorable acl2::__function__))
        (mbe :logic
             (b* ((x (and t x))
                  (p (cdr (std::da-nth 0 x)))
                  (a (cdr (std::da-nth 1 x)))
                  (b (cdr (std::da-nth 2 x))))
               (if (and (dm::primep p)
                        (fep b p)
                        (not (equal b 0)))
                   b
                 1))
             :exec (cdr (std::da-nth 2 x)))))

    Theorem: montgomery-curve->b$inline-of-montgomery-curve-fix-x

    (defthm montgomery-curve->b$inline-of-montgomery-curve-fix-x
      (equal (montgomery-curve->b$inline (montgomery-curve-fix x))
             (montgomery-curve->b$inline x)))

    Theorem: montgomery-curve->b$inline-montgomery-curve-equiv-congruence-on-x

    (defthm
      montgomery-curve->b$inline-montgomery-curve-equiv-congruence-on-x
      (implies (montgomery-curve-equiv x x-equiv)
               (equal (montgomery-curve->b$inline x)
                      (montgomery-curve->b$inline x-equiv)))
      :rule-classes :congruence)