Narwhal and Tusk
George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman
Abstract
We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. We design and evaluate a mempool protocol, Narwhal, specializing in high-throughput reliable dissemination and storage of causal histories of transactions. Narwhal tolerates an asynchronous network and maintains high performance despite failures. Narwhal is designed to easily scale-out using multiple workers at each validator, and we demonstrate that there is no foreseeable limit to the throughput we can achieve.
Topics & Concepts
Computer scienceValidatorAsynchronous communicationThroughputDatabase transactionProtocol (science)Task (project management)Distributed computingComputer networkDatabaseWorld Wide WebWirelessTelecommunicationsManagementPathologyEconomicsMedicineAlternative medicineDistributed systems and fault toleranceBlockchain Technology Applications and SecurityAdvanced Memory and Neural Computing