Efficient L2 Batch Posting Strategy on L1

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%. On the other hand, the algorithm that only cares moderately about queue length can improve the trivial algorithm posting costs by 29%.