Open Network of Permissioned Ledgers Abstract A permissioned ledger with multiple distributed replicas is designed and implemented to circumvent CAP theorem and the FLP result. Each replica implements highly available mufti-partition transactions with scaled out data operations that do not degrade throughput and latency. The ledger implements a fully asynchronous leaderless Byzantine consensus algorithm. Multiple such ledgers are integrated in a federation with open membership and no central administration where safety and liveness of distributed transactions that modify state of two ledgers are guaranteed regardless of anything that may go wrong within the tolerated limit per ledger participating in chain from sending account to recipient account. Q, 0 (D3 0 0 a ((D 03 c 0 U)) 0 0 a.0 0 (3 0 0 -. C 0 0) -- p 00-pp0 0r C (*) 0 0) c0 U)
- A system providing delivery of messages between two computers or between a computer and plurality of computers that is tolerant to a network link partition.
- A method of providing detection, neutralization, and recovery of a stop-faulty process on a computer of a cluster of computers.
- A cluster of computers ensuring high-availability of horizontally scaled data by performing highly available deterministic transactions.
- A digital ledger with known number of distributed replicas with atomically consistent data, modified with deterministic transactions executed on each replica under sequential order established with an asynchronous leaderless Byzantine agreement algorithm.
- A multitude of digital permissioned ledgers integrated in a network with open membership for execution of interledger transactions with safety and liveness guarantees that are equivalent to the guarantees of the participating permissioned ledger with weakest guarantees.
-
Klianev Ivan
Explore more patents:
-
G06F21/64
Explore more patents:
-
G06F17/00
Explore more patents:
Document Preview
- Publication: Dec 8, 2016
-
Application:
Nov 11, 2016
AU 2016/101976 A
-
Priority:
Nov 11, 2016
AU 2016/101976 A