855 citations · 2.9k across the 86 of their papers we have counts for
10 papers · 1 filter
Information Dispersal with Provable Retrievability for Rollups
Kamilla Nazirkhanova, Joachim Neu, David Tse
The ability to verifiably retrieve transaction or state data stored off-chain is crucial to blockchain scaling techniques such as rollups or sharding. We formalize the problem and…
Three Attacks on Proof-of-Stake Ethereum
Caspar Schwarz-Schilling, Joachim Neu, Barnabé Monnot +3
Recently, two attacks were presented against Proof-of-Stake (PoS) Ethereum: one where short-range reorganizations of the underlying consensus chain are used to increase individual…
TaiJi: Longest Chain Availability with BFT Fast Confirmation
Songze Li, David Tse
Most state machine replication protocols are either based on the 40-years-old Byzantine Fault Tolerance (BFT) theory or the more recent Nakamoto's longest chain design. Longest cha…
Snap-and-Chat Protocols: System Aspects
Joachim Neu, Ertem Nusret Tas, David Tse
The availability-finality dilemma says that blockchain protocols cannot be both available under dynamic participation and safe under network partition. Snap-and-chat protocols have…
PoSAT: Proof-of-Work Availability and Unpredictability, without the Work
Soubhik Deb, Sreeram Kannan, David Tse
An important feature of Proof-of-Work (PoW) blockchains is full dynamic availability, allowing miners to go online and offline while requiring only 50% of the online miners to be h…
Ebb-and-Flow Protocols: A Resolution of the Availability-Finality Dilemma
Joachim Neu, Ertem Nusret Tas, David Tse
The CAP theorem says that no blockchain can be live under dynamic participation and safe under temporary network partitions. To resolve this availability-finality dilemma, we formu…