• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • 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
          • Jubjub
          • Verify-zcash-r1cs
          • Lift-zcash-r1cs
          • Pedersen-hash
            • Pedersen-segment-scalar
            • Pedersen-segment-point
            • Find-group-hash
            • Pedersen-point
            • Pedersen-enc
            • Group-hash
            • Coordinate-extract
            • Pedersen-segment-addend
            • Pedersen
            • Pedersen-pad
              • Pedersen-hash-injectivity-properties
              • Pedersen-hash-bound-properties
              • Pedersen-hash-image-properties
              • *pedersen-c*
            • Zcash-gadgets
            • Bit/byte/integer-conversions
            • Constants
            • Blake2-hash
            • Randomness-beacon
          • ACL2-programming-language
          • Prime-fields
          • Json
          • Syntheto
          • File-io-light
          • Cryptography
          • Number-theory
          • Lists-light
          • Axe
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Pedersen-hash

    Pedersen-pad

    Pedersen hash padding [ZPS:5.4.1.7].

    Signature
    (pedersen-pad m) → m1
    Arguments
    m — Guard (bit-listp m).
    Returns
    m1 — Type (bit-listp m1).

    The message is padded with zero bits on the right to make its length a multiple of 3.

    Definitions and Theorems

    Function: pedersen-pad

    (defun pedersen-pad (m)
      (declare (xargs :guard (bit-listp m)))
      (declare (xargs :guard (consp m)))
      (let ((__function__ 'pedersen-pad))
        (declare (ignorable __function__))
        (append (bit-list-fix m)
                (case (mod (len m) 3)
                  (0 nil)
                  (1 (list 0 0))
                  (2 (list 0))))))

    Theorem: bit-listp-of-pedersen-pad

    (defthm bit-listp-of-pedersen-pad
      (b* ((m1 (pedersen-pad m)))
        (bit-listp m1))
      :rule-classes :rewrite)

    Theorem: len-of-pedersen-pad

    (defthm len-of-pedersen-pad
      (b* ((?m1 (pedersen-pad m)))
        (equal (len m1)
               (* 3 (ceiling (len m) 3)))))

    Theorem: multiple-of-3-len-of-pedersen-hash

    (defthm multiple-of-3-len-of-pedersen-hash
      (b* ((?m1 (pedersen-pad m)))
        (integerp (/ (len m1) 3))))