Cover Image

Ephemeral Rollups are All you Need

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Picco, Gabriele, Fortugno, Andrea
Format:	Preprint
Published:	2023
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dynamic Fraud Proof
by: Picco, Gabriele, et al.
Published: (2025)

Lollipop: SVM Rollups on Solana
by: Cardenas, Irvin Steve, et al.
Published: (2024)

A Rollup Comparison Framework
by: Gorzny, Jan, et al.
Published: (2024)

CrowdProve: Community Proving for ZK Rollups
by: Stephan, John, et al.
Published: (2025)

UAT20: Unifying Liquidity Across Rollups
by: Li, Yue, et al.
Published: (2025)

A Decentralized Sequencer and Data Availability Committee for Rollups Using Set Consensus
by: Capretto, Margarita, et al.
Published: (2025)

Ethical Risk Analysis of L2 Rollups
by: Ishmaev, Georgy, et al.
Published: (2025)

RollupTheCrowd: Leveraging ZkRollups for a Scalable and Privacy-Preserving Reputation-based Crowdsourcing Platform
by: Bendada, Ahmed Mounsf Rafik, et al.
Published: (2024)

From Data Center IoT Telemetry to Data Analytics Chatbots -- Virtual Knowledge Graph is All You Need
by: Khan, Junaid Ahmed, et al.
Published: (2025)

Reliablocks: Developing Reliability Scores for Optimistic Rollups
by: Das, Souradeep, et al.
Published: (2025)

A Practical Rollup Escape Hatch Design
by: Figueira, Francisco Gomes, et al.
Published: (2025)

RegGuard: Legitimacy and Fairness Enforcement for Optimistic Rollups
by: Shang, Zhenhang, et al.
Published: (2026)

Analyzing Performance Bottlenecks in Zero-Knowledge Proof Based Rollups on Ethereum
by: Habib, Md. Ahsan
Published: (2025)

180 Days After EIP-4844: Will Blob Sharing Solve Dilemma for Small Rollups?
by: Lee, Suhyeon
Published: (2024)

It does not matter how you define locally checkable labelings
by: Cruciani, Antonio, et al.
Published: (2026)

Fork is All You Need in Heterogeneous Systems
by: Wang, Zixuan, et al.
Published: (2024)

It's not a lie if you don't get caught: simplifying reconfiguration in SMR through dirty logs
by: Clement, Allen, et al.
Published: (2026)

Enabling Secure and Ephemeral AI Workloads in Data Mesh Environments
by: Patel, Chinkit, et al.
Published: (2025)

Can you keep a secret? A new protocol for sender-side enforcement of causal message delivery
by: Tong, Yan, et al.
Published: (2026)

MPI Progress For All
by: Zhou, Hui, et al.
Published: (2024)

Optimal Broadcast Schedules in Logarithmic Time with Applications to Broadcast, All-Broadcast, Reduction and All-Reduction
by: Träff, Jesper Larsson
Published: (2024)

Fast and Secure Decentralized Optimistic Rollups Using Setchain
by: Capretto, Margarita, et al.
Published: (2024)

Do We Need Tensor Cores for Stencil Computations?
by: Gu, Qiqi, et al.
Published: (2026)

Memory and Bandwidth are All You Need for Fully Sharded Data Parallel
by: Wang, Jiangtao, et al.
Published: (2025)

Configurable Non-uniform All-to-all Algorithms
by: Fan, Ke, et al.
Published: (2024)

Revisiting the Time Cost Model of AllReduce
by: Xiong, Dian, et al.
Published: (2024)

What Every Computer Scientist Needs To Know About Parallelization
by: Adefemi, Temitayo
Published: (2025)

PICO: Accelerating All k-Core Paradigms on GPU
by: Zhao, Chen, et al.
Published: (2024)

Why Ethereum Needs Fairness Mechanisms that Do Not Depend on Participant Altruism
by: Spiesberger, Patrick, et al.
Published: (2026)

LMetric: Simple is Better - Multiplication May Be All You Need for LLM Request Scheduling
by: Zhang, Dingyan, et al.
Published: (2026)

Scaling All-to-all Operations Across Emerging Many-Core Supercomputers
by: Kinkead, Shannon, et al.
Published: (2026)

Monte Cimone v2: Down the Road of RISC-V High-Performance Computers
by: Venieri, Emanuele, et al.
Published: (2025)

Understanding the Communication Needs of Asynchronous Many-Task Systems -- A Case Study of HPX+LCI
by: Yan, Jiakun, et al.
Published: (2025)

Space Filling Curves is All You Need: Communication-Avoiding Matrix Multiplication Made Simple
by: Georganas, Evangelos, et al.
Published: (2026)

Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on x86 Architectures
by: Calderón, Sergio, et al.
Published: (2024)

Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
by: Cicerone, Serafino, et al.
Published: (2025)

On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
by: Cicerone, Serafino, et al.
Published: (2025)

Slicing Is All You Need: Towards A Universal One-Sided Algorithm for Distributed Matrix Multiplication
by: Brock, Benjamin, et al.
Published: (2025)

Efficient Probabilistic Workflow Scheduling for IaaS Clouds
by: Russo, Gabriele Russo, et al.
Published: (2024)

Do GPUs Really Need New Tabular File Formats?
by: Luo, Jigao, et al.
Published: (2026)