Happy to share two research posts supported under FRP-47!
In these posts, we focused on analyzing Taiko’s total anarchy sequencing method, a decentralized approach where any participant can propose blocks, leading to a competitive and sometimes inefficient environment.
In the first post, we explained the overall Taiko architecture, detailed the PGA dynamics occurring during sequencing, and analyzed the costs incurred by different proposers in the system.
In the second post, we examined sequencer behaviors more deeply and explored evidence of offchain agreements. We also introduced preconfirmations as a potential solution to improve the Taiko architecture’s efficiency and predictability.
As part of future work, we plan to explore the tradeoffs involved in integrating preconfirmations, specifically, how they might enhance the system while potentially introducing centralization and latency risks.