Coding Techniques Achieve Near-Optimal Synchronous BFT Communication Complexity
The Hamster protocol uses coding techniques to reduce Byzantine Fault Tolerance communication to near-optimal $O(mn)$, unlocking linear throughput scaling.
Obfuscation Enables Deterministic Asynchronous Consensus Defying FLP Impossibility
Program obfuscation and time-lock puzzles overcome the FLP impossibility, yielding a deterministic consensus for asynchronous networks.
Biomimetic Consensus Achieves Asymmetric Sybil Resistance Surpassing Proof-of-Stake Security
Proof-of-Balance, a biomimetic asymmetric Sybil-resistance mechanism, fundamentally redesigns consensus to achieve a four-order-of-magnitude security increase.
