Byzantine agreement using communications having linear complexity
AssigneeVMware, Inc.
InventorsIttai Abraham, Dahlia Malkhi, Alexander Spiegelman, Guy Golan Gueta
Life of this patent
Estimating the term…
Loading patent…
AssigneeVMware, Inc.
InventorsIttai Abraham, Dahlia Malkhi, Alexander Spiegelman, Guy Golan Gueta
Estimating the term…
The disclosure describes a failure-free execution agreement that includes n=3F+1 parties acting as replicas, and a number of parties acting as clients. One replica is designated as a primary. At most F replicas are presumed Byzantine faulty. The basic agreement protocol proceeds in three rounds: (1) client sends a request to the primary, who sends to all replicas; (2) each replica sends a threshold-part signature on hash to a first collector; (3) the collector combines the threshold-parts into a single signature and sends to all 3F+1 replicas which then commit and send to a second collector. The client proceeds when a signed block of requests arrives from the second collector.
A method of using a fault tolerant state machine replication protocol to update state in a replicated state machine comprising a plurality of computing devices, the method comprising:
A non-transitory computer-readable storage medium having stored thereon computer executable instructions, which when executed among a plurality of computer devices that constitute a replicated state machine, cause the plurality of computer devices to update state in the replicated state machine using a fault tolerant state machine replication protocol, including:
A replicated state machine comprising:
Dependencies are inferred from the claim text.