A mechanism design overview of Sedna

Researchers Benjamin Marsh and Alejandro Ranchal-Pedrosa have published a deep dive into the incentive mechanics of Sedna, a next-generation blockchain consensus protocol. Sedna is designed for high throughput and privacy by sharding transaction payloads into "rateless symbols" and disseminating them across parallel proposer lanes. However, the paper identifies a sharp failure mode: a cartel of lane proposers can withhold bundles addressed to its lanes. This slows the chain's progress while the cartel privately pools the missing symbols, exploiting a multi-slot information lead. The delay probability is governed by a chain-level event where the chain fails to accumulate the κ (kappa) bundles needed for decoding within an honest time horizon.

The core solution proposed is PIVOT-K, a "pivotal bundle bounty" native to Sedna. Instead of rewarding all proposers, PIVOT-K concentrates rewards specifically on the κ bundles that actually trigger the decoding of a block. This creates explicit mathematical conditions for incentive compatibility, protecting against both partial and coalition deviations by malicious actors. The researchers further show that an adaptive sender "ratchet," which excludes lanes that don't redeem their tickets, can collapse multi-slot attacks into a first-slot deficit, reducing the required bounty by orders of magnitude. The final result is a robust protocol where, for realistic parameters, the cost of malicious MEV extraction plummets to a negligible 0.04% of the transaction value.