Proven Transaction Flow Control for zk-Rollups

In blockchains, the number of transactions in each block is limited. In order to determine which transactions are included, a fee-based model is regularly used. At the same time, zk-rollups, which are often used as a layer 2 scalability solution for blockchains, are based on the same underlying fee model. In this paper we propose studying the inclusion of transaction flow control algorithms in zk-proofs to investigate alternative transaction fee models in zk-rollups or validiums by enabling proven flow control. We study the provability and the cost of control algorithms that manage the flow of transactions, preventing excessive volume and spamming. The evaluation of our proposition, based on our minimal zk-rollup implementation, demonstrates the effectiveness of these algorithms and their relative proof generation complexity. This can lead to new applications that need anti-spam protection or new fee models in a secure environment.