Mempool protocol

We can define this problem as follows:

Consider a system of \(n\) servers receiving a stream of authenticated transactions from clients. The mempool protocol ensures the following: Availability: The output of the mempool protocol is always available. If an honest client queries the system with a transaction identifier it must be able to obtain the full original transaction.

Papers

  • Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus. George Danezis, Eleftherios Kokoris Kogias, Alberto Sonnino, and Alexander Spiegelman. 2021
  • Scaling Blockchain Consensus via a Robust Shared Mempool. Fangyu Gai, Jianyu Niu, Ivan Beschastnikh, Chen Feng, and Sheng Wang. 2022
  • Leopard: Towards High Throughput-Preserving BFT for Large-scale Systems. Kexin Hu, Kaiwen Guo, Qiang Tang, Zhenfeng Zhang, Hao Cheng, and Zhiyang Zhao. 2022
  • Lo : An Accountable Mempool for MEV Resistance. Bulat Nasrulin, Georgy Ishmaev, Jérémie Decouchant, and Johan Pouwelse. 2023
  • BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation. Alireza Kavousi, Duc V. Le, Philipp Jovanovic, and George Danezis. 2023
  • A Data Flow Framework with High Throughput and Low Latency for Permissioned Blockchains. Zhenxing Hu, Shengjie Guan, Wenbo Xu, Zhen Xiao, Jie Shi, Pengze Li, Qiuyu Ding, Hui Ding, and Chao Zeng. 2023
  • Practical Mempool Privacy via One-time Setup Batched Threshold Encryption. Arka Rai Choudhuri, Sanjam Garg, Guru-Vamsi Policharla, and Mingyuan Wang. 2024
  • Rorqual: Speeding up Narwhal with TEEs. Luciano Freitas, Shashank Motepalli, Matej Pavlovic, and Benjamin Livshits. 2024
  • Slightly related, not exactly Kauri: Scalable BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation. Ray Neiheiser, Miguel Matos, and Luís Rodrigues. 2021