Byzantine Fault Tolerant Quorum Consensus
Mathematical Fault Tolerance Model
Section titled โMathematical Fault Tolerance ModelโIn a defense swarm consisting of N authenticated agent nodes, the swarm can tolerate up to f actively malicious or colluding Byzantine agents while guaranteeing safety (no two non-faulty nodes commit contradictory mitigation actions) and liveness (valid defense actions proceed without deadlock):
Max Byzantine Faults: f = floor((N - 1) / 3)Quorum Commitment Threshold: Q = 2f + 1For the canonical 7-node Hermes core defense swarm:
N = 7agent nodesf = floor((7 - 1) / 3) = 2simultaneous Byzantine adversaries tolerated- Required quorum votes:
Q = 2(2) + 1 = 5valid cryptographic signatures
3-Phase Consensus Protocol Execution
Section titled โ3-Phase Consensus Protocol ExecutionโCLIENT / CTI TRIGGER | v (Mitigation Proposal)+-----------------------+| Primary (Leader) |+-----------------------+ | | 1. PRE-PREPARE (Proposal Hash + BLS Signature) +-----------------------+-----------------------+ | | | v v v+---------------+ +---------------+ +---------------+| Replica 1 | | Replica 2 | | Replica 3 |+---------------+ +---------------+ +---------------+ | | | | 2. PREPARE Multicast (Verify preconditions, vote if valid) |<--------------------->|<--------------------->| | | (Once 2f + 1 = 5 valid Prepare votes accumulated) | | 3. COMMIT Multicast (Cryptographic threshold commitment) |<--------------------->|<--------------------->| | v+---------------------------------------------------------------+| EXECUTION & HASH-CHAIN MERKLE COMMIT |+---------------------------------------------------------------+Protocol State Machine Phases
Section titled โProtocol State Machine Phasesโ-
Pre-Prepare Phase: The elected Leader receives a CTI trigger or mitigation request, computes its canonical SHA-256 action hash, appends view number
vand sequence numbern, signs the tuple using its private BLS12-381 key, and multicasts the message to all swarm replicas. -
Prepare Phase: Each replica independently verifies:
- The Leaderโs signature and active SPIFFE lease;
- That sequence number
nfalls within the allowable window; - That the proposed mitigation does not conflict with active invariants or cause catastrophic business disruption.
If verified, the replica multicasts a signed
PREPAREmessage.
-
Commit Phase: Upon collecting
2f + 1 = 5validPREPAREmessages from distinct nodes, the replica enters the prepared state and multicasts a signedCOMMITmessage. When2f + 1COMMITmessages are verified, the defensive action is committed to the swarm ledger and dispatched to infrastructure enforcers.
Supported Swarm Consensus Protocols
Section titled โSupported Swarm Consensus Protocolsโ1. PBFT Defense Swarm (CONS-PBFT-01)
Section titled โ1. PBFT Defense Swarm (CONS-PBFT-01)โ- Target Workload: High-consequence firewall blocks, identity revocation, and EDR host isolation.
- Latency Profile:
p50 = 14.2 ms,p99 = 48.7 ms. - Signature Scheme: BLS12-381 Threshold Aggregated Signatures (1 single compressed signature over the network).
2. High-Throughput Raft-BFT (CONS-RAFT-BFT-02)
Section titled โ2. High-Throughput Raft-BFT (CONS-RAFT-BFT-02)โ- Target Workload: Continuous threat intelligence ingestion (CISA KEV, EPSS shifts, Honeypot logs).
- Latency Profile:
p50 = 4.8 ms,p99 = 19.3 ms. - Resilience:
f = floor((N - 1) / 2)for crash faults, with asymmetric cryptographic nonce stamping preventing equivocation.
3. Federated Quorum Slices (CONS-FED-QUORUM-03)
Section titled โ3. Federated Quorum Slices (CONS-FED-QUORUM-03)โ- Target Workload: Cross-SOC collaborative mitigation across sovereign enterprise enclaves without a single centralized coordinator.
- Topology: Overlapping trust slices where Q1 and Q2 intersect reliably.
Machine-Readable Specification
Section titled โMachine-Readable Specificationโ{ "protocol_id": "CONS-PBFT-01", "section": 71, "node_count": 7, "max_byzantine_faults": 2, "quorum_threshold": 5, "view_change_timeout_ms": 750, "sub_second_finality": true}