• 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
      • Where-do-i-place-my-book
      • Axe
      • Bigmems
      • Builtins
      • Execloader
      • Aleo
        • Aleobft
          • Aleobft-static
          • Aleobft-stake2
          • Aleobft-dynamic
          • Aleobft-stake
          • Aleobft-proposals
            • Correctness
            • Definition
              • Initialization
              • Transitions
              • States
                • Committees
                • System-states
                • Certificates
                • Transactions
                • Proposals
                • Messages
                  • Message
                  • Make-endorsement-messages
                  • Make-certificate-messages
                  • Make-proposal-messages
                  • Message-set
                • Validator-states
                • Blocks
                • Addresses
              • Events
              • Reachability
          • Library-extensions
        • Leo
      • Solidity
      • Paco
      • Concurrent-programs
      • Bls12-377-curves
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
    • Testing-utilities
  • States
  • Events

Messages

Messages.

We model the network that connects the validators as consisting of authenticated point-to-point connections with unbounded delays, as commonly assumed in the BFT literature. We model messages that include information about both sender and receiver, and we model the network (in the system states) as the set of messages currently in transit, i.e. sent but not yet received.

There are three kinds of messages: proposals, endorsements, and certificates.

Subtopics

Message
Fixtype of messages.
Make-endorsement-messages
Create messages for an endorsement from given endorsers.
Make-certificate-messages
Create messages for a certificate with given destinations.
Make-proposal-messages
Create messages for a proposal with given destinations.
Message-set
Fixtype of sets of messages.