The Rollup Coaster is a bi-weekly newsletter that dives into the fascinating world of Ethereum, exploring the latest in rollups, zero-knowledge proofs, based sequencing/preconfirmations, MEV/PBS/SUAVE, and much more.

This edition is written by Taiko’s Community Advocate Jünger.

Hold on tight! 🎢

Disclaimer: This newsletter is neither financial advice, nor is indicative of Taiko’s position on any of the material presented. Please do your own research.

• Vitalik discussed ways to improve Ethereum's confirmation times by exploring different techniques, including single-slot finality and preconfirmations. He explains the current slot-and-epoch architecture and suggests modifications to achieve faster confirmations.

• Jon Charbonneau shared an article titled "We're All Building the Same Thing," which covers various aspects of system design and performance optimization. The article also discusses the impact of these designs on transaction validity, consensus mechanisms, and cross-chain composability, highlighting the convergence of different blockchain systems towards similar architectures.

• Ethereum execution client Reth 1.0 has been released after two years of development. It’s a very important milestone for the diversity of clients.

• A new paper titled "Asynchronous Consensus without Trusted Setup or Public-Key Cryptography" has been published. The paper introduces an efficient and post-quantum secure asynchronous Byzantine consensus protocol that operates without public-key cryptography and is practical for geo-distributed systems.

• Ingonyama shared a paper about high-level polynomial framework and API for efficient Zero Knowledge Proofs in the ICICLE v2 library, abstracting hardware optimization for ease of use.

• Donnoh (L2Beat) shared an article about the method of building the safest optimium.

• A brief summary of Sumcheck Protocol by Aligned.

• RISC Zero introduced zkVM 1.0.

• Arbitrum introduced Timeboost, a new tx ordering policy for Arbitrum chains. It's basically a sealed-bid auction with a 2nd price, where the winner of the round gains a time advantage (not the right to order).

• Two Zero Knowledge Podcast episode dropped.

• Multicall3 deployed on Taiko. Now it’s possible to batch multiple transactions into a single one.

• Scroll’s weekly mainnet update.

• Optimism’s weekly updates.

• BCR protocol upgrade from Taiko. This upgrade includes reducing the validity bond, removing hook calls, etc.

• Avoiding Accidental Liveness Faults for Based Preconfs by mteam from Spire.

• A simple, small, mev-boost compatible preconfirmation idea by Fabrizio.

• Based Preconfs for Dummies by idanlevin.

• This talk at Zuberlin covers Ethereum's centralization problem and a proposed solution with autonomous TEEs by Poetic: Redecentralizing Ethereum and the issue of TEEs.

• SGX as 2FA for FHE/MPC by Wenfeng.

• Flashwares IV: TEEception by Flashbots.

• Jon Charbonneau summarized the current and future landscape of Ethereum’s supply chain.

• ePBS FAQ by Terence.

• Request for SuApp: Kettle Cash by Andrew Miller.

• Execution Auctions as an Alternative to Execution Tickets by Jonah and David.

• 

  Mr Anon

  @ShieldifyAnon

  

  What is a Merkle Tree?
  
  Merkle tree is a generalisation of a hash list or a hash chain. It has “leaf” nodes, each of them have a cryptographic hash of a data black they’re accossiated with. Every node that is not a “leaf” (they’re called branch or inner node) is labelled with the

  

  143

  9:30 AM • Jun 23, 2024

• All ZuBerlin talks can be accessed here. The event covers topics like MEV, cryptography, sequencing.

Explore open positions on our job board.

Get the latest from Taiko:

• Website: https://taiko.xyz.

• Discord: https://discord.gg/taikoxyz.

• GitHub: https://github.com/taikoxyz.

• Twitter: https://twitter.com/taikoxyz.

• Community forum: https://community.taiko.xyz.

• YouTube: https://www.youtube.com/@taikoxyz.

• Warpcast: https://warpcast.com/taikoxyz.

Contribute to Taiko on GitHub and earn a GitPOAP! You will also be featured as a contributor on our README. Get started with the contributing manual.