Efficient L2 Batch Posting Strategy on L1

12/20/2022
by   Akaki Mamageishvili, et al.
0

We design efficient algorithms for the batch posting of Layer 2 chain calldata on the Layer 1 chain, using tools from operations research. We relate the costs of posting and delaying, by converting them to the same units. The algorithm that keeps the average and maximum queued number of batches tolerable enough improves the posting costs of the trivial algorithm that posts batches immediately when they are created by 8 only cares moderately about queue length can improve the trivial algorithm posting costs by 29

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2023

Batch Prompting: Efficient Inference with Large Language Model APIs

Performing inference on hundreds of thousands of samples with large lang...
research
07/18/2020

Optimizing Off-Chain Payment Networks in Cryptocurrencies

Off-chain transaction channels represent one of the leading techniques t...
research
06/12/2018

The queue-number of planar posets

Heath and Pemmaraju conjectured that the queue-number of a poset is boun...
research
09/22/2022

Layer Freezing Data Sieving: Missing Pieces of a Generic Framework for Sparse Training

Recently, sparse training has emerged as a promising paradigm for effici...
research
01/08/2023

SpeeChain: A Speech Toolkit for Large-Scale Machine Speech Chain

This paper introduces SpeeChain, an open-source Pytorch-based toolkit de...
research
04/29/2020

An Almost Exact Linear Complexity Algorithm of the Shortest Transformation of Chain-Cycle Graphs

A "genome structure" is a labeled directed graph with vertices of degree...

Please sign up or login with your details

Forgot password? Click here to reset