5 papers
Securing Parallel-chain Protocols under Variable Mining Power
Xuechao Wang, Viswa Virinchi Muppirala, Lei Yang +2
Several emerging PoW blockchain protocols rely on a "parallel-chain" architecture for scaling, where instead of a single chain, multiple chains are run in parallel and aggregated.…
The Twelvefold Way of Non-Sequential Lossless Compression
Taha Ameen ur Rahman, Alton S. Barbehenn, Xinan Chen +27
Many information sources are not just sequences of distinguishable symbols but rather have invariances governed by alternative counting paradigms such as permutations, combinations…
Blockchain CAP Theorem Allows User-Dependent Adaptivity and Finality
Suryanarayana Sankagiri, Xuechao Wang, Sreeram Kannan +1
Longest-chain blockchain protocols, such as Bitcoin, guarantee liveness even when the number of actively participating users is variable, i.e., they are adaptive. However, they are…
Everything is a Race and Nakamoto Always Wins
Amir Dembo, Sreeram Kannan, Ertem Nusret Tas +4
Nakamoto invented the longest chain protocol, and claimed its security by analyzing the private double-spend attack, a race between the adversary and the honest nodes to grow a lon…
Proof-of-Stake Longest Chain Protocols: Security vs Predictability
Vivek Bagaria, Amir Dembo, Sreeram Kannan +5
The Nakamoto longest chain protocol is remarkably simple and has been proven to provide security against any adversary with less than 50% of the total hashing power. Proof-of-stake…