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%.

翻译：我们设计了高效的算法,用于在图层1链上批次张贴图层2连锁呼叫数据,使用操作研究工具。我们通过将它们转换为相同的单位来计算张贴和延迟的成本。保持平均和最多排队批量的算法可以足够忍受,这提高了小数算法的张贴成本,当排队长度由8%生成时,该算法会立即进行排队。另一方面,只关注中度排队长度的算法可以提高29%的小数算法张贴成本。