{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:01:08Z","timestamp":1783008068404,"version":"3.54.5"},"reference-count":70,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/sp63933.2026.00255","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:34:20Z","timestamp":1782934460000},"page":"1970-1988","source":"Crossref","is-referenced-by-count":1,"title":["The Pipes Model for Latency and Throughput Analysis"],"prefix":"10.1109","author":[{"given":"Andrew","family":"Lewis-Pye","sequence":"first","affiliation":[{"name":"London School of Economics"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nibesh","family":"Shrestha","sequence":"additional","affiliation":[{"name":"Supra Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"issue":"1999","key":"ref4","first-page":"173","article-title":"Practical byzantine fault tolerance","author":"Castro","year":"1999","journal-title":"OSDI"},{"key":"ref5","article-title":"The latest gossip on BFT consensus","volume-title":"CoRR","volume":"abs\/1807.04938","author":"Buchman","year":"2018"},{"key":"ref6","volume-title":"Tendermint: Byzantine fault tolerance in the age of blockchains","author":"Buchman","year":"2016"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"ref8","article-title":"Hotstuff-2: Optimal two-phase responsive bft","author":"Malkhi","year":"2023","journal-title":"Cryptology ePrint Archive"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"ref11","first-page":"813","article-title":"Shoal++: High throughput {DAG}{BFT} can be fast and robust!","volume-title":"USENIX NSDI \u201925","author":"Arun"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00021"},{"key":"ref13","article-title":"Cordial miners: Fast and efficient consensus for every eventuality","volume-title":"DISC\u201923","author":"Keidar"},{"key":"ref14","article-title":"Mysticeti: Low-latency dag consensus with fast commit path","author":"Babel","year":"2023","journal-title":"arXiv preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3694715.3695942"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363213"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3558535.3559777"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-07035-7_6"},{"key":"ref19","article-title":"Starfish: A high throughput bft protocol on uncertified dag with linear amortized communication complexity","author":"Polyanskii","year":"2025","journal-title":"Cryptology ePrint Archive"},{"key":"ref20","article-title":"Sing a song of simplex","author":"Shoup","year":"2023","journal-title":"Cryptology ePrint Archive"},{"key":"ref21","doi-asserted-by":"crossref","volume-title":"The pipes model for latency and throughput analysis","author":"Lewis-Pye","DOI":"10.1109\/SP63933.2026.00255"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"ref23","volume-title":"Proposer builder separation"},{"key":"ref24","volume-title":"Decentralized timeboost specification"},{"key":"ref25","volume-title":"Single-sender beb implementation","author":"Shrestha"},{"key":"ref26","volume-title":"Multi-sender beb implementation","author":"Shrestha"},{"key":"ref27","volume-title":"Sailfish implementation","author":"Shrestha"},{"key":"ref28","volume-title":"Disperedsimpex implementation","author":"Shrestha"},{"key":"ref29","volume-title":"Google cloud platform - general-purpose machine family for compute engine","year":"2025"},{"key":"ref30","volume-title":"Linux traffic control","year":"2025"},{"key":"ref31","volume-title":"Tc-tbf linux manual page"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"ref35","volume-title":"High-throughput blockchain consensus under realistic network assumptions","author":"Sandro","year":"2024"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670347"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3653445"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3335772.3335936"},{"key":"ref40","article-title":"The latest gossip on bft consensus","author":"Buchman","year":"2018","journal-title":"arXiv preprint"},{"key":"ref41","article-title":"Casper the friendly finality gadget","author":"Buterin","year":"2017","journal-title":"arXiv preprint"},{"key":"ref42","article-title":"Quadratic worst-case message complexity for state machine replication in the partial synchrony model","author":"Lewis-Pye","year":"2022","journal-title":"arXiv preprint"},{"issue":"11","key":"ref43","first-page":"1","article-title":"Byzantine consensus is $\\theta$ ($\\mathrm{n}^{\\wedge} 2$): The dolev-reischuk bound is tight even in partial synchrony!","volume-title":"DISC\u201922","author":"Civit"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331629"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109667"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22963-3_17"},{"key":"ref48","article-title":"Improved extension protocols for byzantine broadcast and agreement","volume-title":"DISC\u201920","author":"Nayak"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00384-1"},{"issue":"1-2","key":"ref50","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0304-3975(98)00263-1","article-title":"Secure distributed storage and retrieval","volume":"243","author":"Garay","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"ref51","volume-title":"Intro to eigenda: Hyperscale data availability for rollups","year":"2023"},{"key":"ref52","volume-title":"Data availability - ethereum.org","year":"2024"},{"key":"ref53","volume-title":"Designing the espresso sequencer: Combining hotshot consensus with tiramisu da","year":"2023"},{"key":"ref54","first-page":"493","article-title":"{DispersedLedger}:{High-Throughput} byzantine consensus on variable bandwidth networks","volume-title":"USENIX NSDI \u201922","author":"Yang"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3558535.3559778"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-47751-5_3"},{"key":"ref57","volume-title":"Nightshade: Near protocol sharding design","volume":"39","author":"Skidanov","year":"2019"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00044"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417284"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"ref61","first-page":"214","article-title":"Aleph: Efficient atomic broadcast in asynchronous networks with byzantine nodes","volume-title":"AFT\u201919","author":"Gkagol"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS57955.2024.00093"},{"key":"ref63","article-title":"Blockmania: from block dags to consensus","author":"Danezis","year":"2018","journal-title":"arXiv preprint"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-78676-1_6"},{"key":"ref65","first-page":"515","article-title":"A decentralized blockchain with high throughput and fast confirmation","volume-title":"USENIX ATC\u201920","author":"Li"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00008"},{"key":"ref67","volume-title":"Coded transaction broadcasting for high-throughput blockchains","author":"Yang","year":"2022"},{"key":"ref68","author":"Nakamoto","year":"2008","journal-title":"Bitcoin: A peer-to-peer electronic cash system"},{"key":"ref69","article-title":"Bbca-chain: Onemessage, low latency bft consensus on a dag","volume-title":"International Conference on Financial Cryptography and Data Security","author":"Malkhi"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"}],"event":{"name":"2026 IEEE Symposium on Security and Privacy (SP)","location":"San Francisco, CA, USA","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["2026 IEEE Symposium on Security and Privacy (SP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11573355\/11573356\/11573603.pdf?arnumber=11573603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:32:13Z","timestamp":1782970333000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11573603\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":70,"URL":"https:\/\/doi.org\/10.1109\/sp63933.2026.00255","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}