• 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
      • Riscv
      • Taspi
      • 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
          • Correctness
            • Unequivocal-dags-def-and-init
            • Same-committees-def-and-implied
            • Dag-omni-paths
            • Signer-records
              • Signer-records-p-of-next
              • Signer-record-p
              • Signer-records-p
                • Signer-records-p-when-init
                • Signer-records-p-when-reachable
                • Signer-records-p-of-events-next
              • Unequivocal-dags-next
              • Quorum-intersection
              • Dag-previous-quorum-def-and-init-and-next
              • Unequivocal-signed-certificates
              • Signed-previous-quorum
              • Nonforking-anchors-def-and-init-and-next
              • Successor-predecessor-intersection
              • Fault-tolerance
              • Last-anchor-voters-def-and-init-and-next
              • Signer-quorum
              • Committed-redundant-def-and-init-and-next
              • Nonforking-blockchains-def-and-init
              • Blockchain-redundant-def-and-init-and-next
              • No-self-endorsed
              • Last-anchor-present
              • Anchors-extension
              • Nonforking-blockchains-next
              • Backward-closure
              • Last-blockchain-round
              • Dag-certificate-next
              • Omni-paths-def-and-implied
              • Ordered-blockchain
              • Simultaneous-induction
              • System-certificates
              • Last-anchor-def-and-init
              • Last-anchor-next
              • Dag-previous-quorum
              • Signed-certificates
              • Committed-anchor-sequences
              • Omni-paths
              • Last-anchor-voters
              • Unequivocal-dags
              • Nonforking-blockchains
              • Nonforking-anchors
              • Committed-redundant
              • Same-committees
              • Blockchain-redundant
            • Definition
            • Library-extensions
          • Aleovm
          • Leo
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Community
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Signer-records

    Signer-records-p

    Definition of the invariant: for every certificate signed by a correct validator, the validator has a record of that certificate.

    We express this on the set of signed certificates defined by signed-certs.

    Definitions and Theorems

    Theorem: signer-records-p-necc

    (defthm signer-records-p-necc
     (implies
      (signer-records-p systate)
      (implies (and (in signer (correct-addresses systate))
                    (in cert (signed-certs signer systate)))
               (signer-record-p (certificate->author cert)
                                (certificate->round cert)
                                (get-validator-state signer systate)))))

    Theorem: booleanp-of-signer-records-p

    (defthm booleanp-of-signer-records-p
      (b* ((yes/no (signer-records-p systate)))
        (booleanp yes/no))
      :rule-classes :rewrite)

    Theorem: signer-records-p-of-system-state-fix-systate

    (defthm signer-records-p-of-system-state-fix-systate
      (equal (signer-records-p (system-state-fix systate))
             (signer-records-p systate)))

    Theorem: signer-records-p-system-state-equiv-congruence-on-systate

    (defthm signer-records-p-system-state-equiv-congruence-on-systate
      (implies (system-state-equiv systate systate-equiv)
               (equal (signer-records-p systate)
                      (signer-records-p systate-equiv)))
      :rule-classes :congruence)