• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
      • Instant-runoff-voting
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Java
      • Taspi
      • Bitcoin
      • Riscv
      • Des
      • Ethereum
      • X86isa
      • Sha-2
      • Yul
      • Zcash
      • Proof-checker-itp13
      • Regex
      • ACL2-programming-language
      • Json
      • Jfkr
      • Equational
      • Cryptography
      • Poseidon
        • Poseidon-main-definition
          • Param
          • Hashp
          • Absorb1
          • Sponge
          • Hash
          • All-rounds
          • Sponge-validp
          • Squeeze1
          • Sub-words-partial
          • Squeeze
          • Round
          • Partial-rounds
          • Mode
          • Full-rounds
          • Permute
          • Sub-words
          • Add-round-constants
          • Mix-layer
          • Dot-product
          • Absorb
          • Pow-by-alpha
          • Param->size
          • Sub-words-full
          • Param->capacity-then-rate-p
          • Param->partial-last-p
          • Param-additional-theorems
            • Param->rounds
            • Param->descending-p
            • Init-sponge
          • Poseidon-instantiations
        • Where-do-i-place-my-book
        • Axe
        • Bigmems
        • Builtins
        • Execloader
        • Aleo
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Poseidon-main-definition

    Param-additional-theorems

    Additional theorems about the parameters in param.

    Definitions and Theorems

    Theorem: posp-of-param->prime

    (defthm posp-of-param->prime
      (posp (param->prime param)))

    Theorem: all-len-equal-p-of-param->constants

    (defthm all-len-equal-p-of-param->constants
      (all-len-equal-p (param->constants param)
                       (param->size param)))

    Theorem: all-len-equal-p-of-param->mds

    (defthm all-len-equal-p-of-param->mds
      (all-len-equal-p (param->mds param)
                       (param->size param)))

    Theorem: len-of-param->constants

    (defthm len-of-param->constants
      (equal (len (param->constants param))
             (param->rounds param)))

    Theorem: len-of-param->mds

    (defthm len-of-param->mds
      (equal (len (param->mds param))
             (param->size param)))

    Theorem: param->rate-less-than-size

    (defthm param->rate-less-than-size
      (< (param->rate param)
         (param->size param))
      :rule-classes :linear)

    Theorem: param->capacity-less-than-size

    (defthm param->capacity-less-than-size
      (< (param->capacity param)
         (param->size param))
      :rule-classes :linear)

    Theorem: param->size-equal-rate+capacity

    (defthm param->size-equal-rate+capacity
      (equal (param->size param)
             (+ (param->rate param)
                (param->capacity param)))
      :rule-classes :linear)