[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-82661-en":3,"doc-seo-82661-105":29,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":13,"seo_description":14,"update_tm":27,"read_time":28},82661,1649267921044,"Ava Thompson","https://us-avatar.wpscdn.com/avatar/1800007509477c92dfb?_k=1782875107921204101",8,"Research & Report","Cadence Extreme Pipelining with Multiple Concurrent Proposers","Cadence presents a Byzantine fault-tolerant multi-proposer consensus protocol designed for arbitrarily low block intervals and strong resilience. Time is partitioned into equally spaced slots, producing one block per slot, each finalized via its own consensus instance. Blocks avoid direct dependency on predecessors, enabling extreme pipelining that decouples block cadence from network latency. Cadence also mitigates proposer monopoly by coordinating multiple concurrent proposers, guaranteeing short-term censorship resistance and hiding under synchrony. It adds an extreme pipelining framework, instantiates it with Chorus and Conductor, and validates low-latency performance via simulation.","arXiv :2607 .02275v2 [ cs .DC] 7 Jul 2026  \nCadence: Extreme Pipelining with Multiple Concurrent  \nProposers  \nKushal Babel, Fatima Elsheimy, Lioba Heimbach, Mohammad Mussadiq Jalalzai, Tobias Klenze,  \nJovan Komatovic, Jason Milionis, Mike Setrin, and Victor Shoup ⋆  \nCategory Labs  \nAbstract. We present Cadence, a Byzantine fault-tolerant multi-proposer consensus protocol with arbitrarily low block intervals, optimal resilience, and optimal fast-path latency. Cadence divides time into equally spaced slots, one block per slot, each finalized in its own consensus instance.  \nBlocks do not build directly on their predecessor, which lets these instances run independently, sonone waits for an earlier block to finish or even to propagate over the network; we call this extreme pipelining, and it decouples the block interval from network latency. Cadence also removes the single-leader monopoly over transaction inclusion and ordering: under multiple concurrent proposers (MCP), several validators propose for each block, and it guarantees that, under synchrony, a transaction a correct proposer includes cannot be censored or deferred to a later block (shortterm censorship resistance), and that no proposer can craft its proposal in reaction to the others’(hiding) .  \nTo realize extreme pipelining, we introduce a framework that turns any one-shot consensus meeting our slot-consensus specification into a multi-shot protocol with arbitrarily low block intervals. It is general and of independent interest. We instantiate it for the MCP setting with two protocols of our own: Chorus, an MCP slot consensus whose fast path finalizes a block in an optimal three communication rounds, with speculative finality one round earlier, and Conductor, an orchestrator that opens slots at an even cadence in normal operation, and more slowly under asynchrony to keep the number of open slots bounded. To our knowledge, Cadence is the first MCP protocol to provide short-term censorship resistance and hiding at the fast-path latency of single-leader consensus. We prove safety, liveness, short-term censorship resistance, and hiding under partial synchrony with optimal resilience (n = 3f + 1) . Beyond the theory, we address the practical considerations of deploying Cadence and evaluate its latency in simulation: over Monad mainnet’s 200 globally distributed validators with five concurrent proposers per slot, the finalization latency averages 219ms (167ms to speculative finality), and at a 100ms block interval, a transaction waits on average only 50ms to enter a proposal.  \n1 Introduction  \nBlockchains increasingly host real-time financial markets, and serving them well places three requirements on the consensus layer. We motivate each, then present our design.  \nRequirement 1: no proposer monopoly. Currently, most deployed protocols use a rotating leader schedule, where there is a uniquely identified entity (the leader) with the short-lived outsized ability to control the inclusion, exclusion and ordering of transactions.1 Recent proposals have emerged to induce competition among the parties that contribute to a block, in what are called multiple concurrent proposer (MCP) designs. There, a proposer schedule rotates the role over time, much as a leader schedule does, but names a more diverse, small set of validators per block who are allowed to simultaneously make their proposals. A combination arising from these different simultaneous proposals ends up forming the final block. To this end, a number of properties form axes along which such designs can be evaluated: Shortterm censorship resistance [1] guarantees that a correct proposer’s proposal is included in the block it contributes to, not dropped or deferred to a later block; so a transaction that reaches a correct proposer is included without delay, as long as the proposer has space for it. Hiding [1] keeps each proposal concealed from the other proposers until it is too late for them to react with a proposal of","cbCainHkVxkVxpuy","https://ap.wps.com/l/cbCainHkVxkVxpuy","pdf",816762,1,65,"English","en",105,"# Abstract\n# Introduction\n## Requirements for consensus in real-time markets\n## Requirement 1: no proposer monopoly\n## Requirement 2: low latency\n## Requirement 3: short economic ticks\n## Related approaches and their latency cost\n# Our protocol","[{\"question\":\"What problem does Cadence address in multi-proposer blockchain consensus?\",\"answer\":\"Cadence targets achieving very low block intervals while maintaining Byzantine fault tolerance, optimal resilience, and strong latency properties. It also removes single-leader monopoly by allowing multiple concurrent proposers to contribute to each block.\"},{\"question\":\"How does Cadence achieve extreme pipelining and reduce dependency on network latency?\",\"answer\":\"Cadence finalizes each slot’s block in its own independent consensus instance without direct construction on the predecessor block. This lets later instances proceed without waiting for earlier blocks to finish propagating.\"},{\"question\":\"What guarantees does Cadence provide regarding censorship and proposal hiding?\",\"answer\":\"Under synchrony, Cadence provides short-term censorship resistance: a transaction included by a correct proposer cannot be censored or deferred to a later block. It also provides hiding, preventing other proposers from reacting to a proposal before it is too late.\"}]",1784182129,164,{"code":4,"msg":30,"data":31},"ok",{"site_id":24,"language":23,"slug":32,"title":13,"keywords":33,"description":14,"schema_data":34,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":27},"cadence-extreme-pipelining-with-multiple-concurrent-proposers","",{"@graph":35,"@context":85},[36,53,68],{"@type":37,"itemListElement":38},"BreadcrumbList",[39,43,47,50],{"item":40,"name":41,"@type":42,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":44,"name":45,"@type":42,"position":46},"https://docshare.wps.com/document/","Document",2,{"item":48,"name":12,"@type":42,"position":49},"https://docshare.wps.com/document/research-report/",3,{"item":51,"name":13,"@type":42,"position":52},"https://docshare.wps.com/document/cadence-extreme-pipelining-with-multiple-concurrent-proposers/82661/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":23,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":40,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-17","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What problem does Cadence address in multi-proposer blockchain consensus?","Question",{"text":75,"@type":76},"Cadence targets achieving very low block intervals while maintaining Byzantine fault tolerance, optimal resilience, and strong latency properties. It also removes single-leader monopoly by allowing multiple concurrent proposers to contribute to each block.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"How does Cadence achieve extreme pipelining and reduce dependency on network latency?",{"text":80,"@type":76},"Cadence finalizes each slot’s block in its own independent consensus instance without direct construction on the predecessor block. This lets later instances proceed without waiting for earlier blocks to finish propagating.",{"name":82,"@type":73,"acceptedAnswer":83},"What guarantees does Cadence provide regarding censorship and proposal hiding?",{"text":84,"@type":76},"Under synchrony, Cadence provides short-term censorship resistance: a transaction included by a correct proposer cannot be censored or deferred to a later block. It also provides hiding, preventing other proposers from reacting to a proposal before it is too late.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":20,"doc_module":4,"doc_module_name":45,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":46,"doc_module":4,"doc_module_name":45,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":45,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":45,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":45,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":45,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":45,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":45,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":45,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":45,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":45,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]