{"paper_id":"2609.21173","title":"Adapting the Actor Model of Concurrency for High-Frequency Trading: Synchronous Message Delivery (fast_send) and a Tick-to-Book Latency Study","authors":["Vincent Maciejewski"],"paper_date":"2026-09-18","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2609.21173","page_url":"https://thequant.space/flowcharts/adapting-the-actor-model-of-concurrency-for-high-frequency-trading-synchronous/","scores":{"empirical_rigor":8,"math_complexity":4,"quadrant":"Street Traders"},"proposes":{"status":"available","statement":"The paper proposes four extensions to the actor model for high‑frequency trading, most notably fast_send—a synchronous delivery mechanism where the sender runs the receiver's handler inline and returns the reply as a value—along with actor groups, selectable mailbox queues, and a memory pool.","quote":"Four extensions adapt the model for HFT: fast_send, a synchronous delivery mechanism in which the sending thread runs the receiver's handler inline and returns the reply as a value; actor groups, which co-schedule actors on one thread behind a shared mailbox; per-actor selectable mailbox queues;","summary":"The actor model - state isolation, data-race freedom, and sequential single-message reasoning - has long been dismissed as unsuitable for high-frequency trading (HFT): actors seem to imply many threads, a mailbox per actor, and a heap-allocated message plus a context switch per interaction…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The work assumes co‑located actors that share an address space, so fast_send can be used without network round‑trip overhead.","type":"model","stated":"implied","quote":"12 Discussion and limitations The scope is co-located actors. fast_send applies only when sender and receiver share an address space; a synchronous cross-machine call would reintroduce the network round trip it exists to avoid, and the actor model’s location transparency means the sender can fall back to asynchronous delivery when the receiver is remote.","support":"full"},{"assumption":"The HFT hot path must meet a microsecond‑level latency budget.","type":"execution","stated":"implied","quote":"The actor model - state isolation, data-race freedom, and sequential single-message reasoning - has long been dismissed as unsuitable for high-frequency trading (HFT): actors seem to imply many threads, a mailbox per actor, and a heap-allocated message plus a context switch per interaction, overhead incompatible with a microsecond budget.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"CME market‑data feed (ES, NQ, ZN futures)","provider":"CME","kind":"market-prices","access":"proprietary","period":null,"universe":"ES, NQ, ZN futures","quote":"On a live CME market-data feed (ES, NQ, ZN futures), when the socket-reader thread decodes each packet and updates the book itself, socket-to-book medians for book updates are 0.8-1.1 microseconds, and a fast_send hop is about 1% of that.","support":"full"},{"name":"Recorded CME sessions used for simulation","provider":null,"kind":"synthetic","access":"proprietary","period":null,"universe":null,"quote":"and order-event messages and emits child-order messages; it was built and validated entirely in simulation, driven from recorded CME sessions, and then deployed to production without modification — the same actor and the same handlers, reading from a live feed instead of a file.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"l2-book"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"Microbenchmarks show the synchronous round‑trip latency of fast_send is on the order of tens of nanoseconds (≈30 ns total, ≈10 ns per hop).","kind":"performance","quote":"Microbenchmarks put the synchronous round trip at tens of nanoseconds. Broken down per hop, a single fast_send invocation costs ∼10 ns, of which a bare (devirtualized) direct call is ∼1 ns measured the same way; so the framework adds ∼10 ns per hop over a direct call, covering the receiver-lock acquire/release, message-field setup, handler-cache dispatch, and reply wrapping.","support":"partial"},{"finding":"When the socket‑reader thread decodes each packet and updates the book, socket‑to‑book median latency is 0.8–1.1 µs, and a fast_send hop adds about 1 % of that latency.","kind":"performance","quote":"On a live CME market-data feed (ES, NQ, ZN futures), when the socket-reader thread decodes each packet and updates the book itself, socket-to-book medians for book updates are 0.8-1.1 microseconds, and a fast_send hop is about 1% of that.","support":"full"},{"finding":"Co‑scheduling two actors on one thread (grouping) reduces a cross‑thread asynchronous round‑trip from ≈3.4 µs to 90 ns, a 37× reduction.","kind":"performance","quote":"Co-scheduling the two actors on one thread (grouping) removes both wakeups and reduces the round trip to 90 ns, a 37× reduction.","support":"partial"},{"finding":"Replacing mailbox push/pop with inline fast_send further reduces the round‑trip to ≈30 ns.","kind":"performance","quote":"Replacing the remaining mailbox push/pop with an inline fast_send reduces the round trip to ∼30 ns (amortized; the per-sample p50 is resolution-bound), because a fast_send is mechanically a locked function call: it takes the receiver’s lock and runs the handler inline.","support":"full"},{"finding":"Using a fixed‑size memory pool cuts the latency tail from a maximum of 5.5 ms to 33 µs, a two‑order‑of‑magnitude reduction in the p99.9+ tail.","kind":"performance","quote":"The larger and platform-independent benefit is the tail: in a separate run the maximum round trip fell from 5.5 ms to 33 µs once pooled, because the pool never takes the general allocator’s occasional slow path: a two-order-of-magnitude reduction of the p99.9+ tail that an unpooled servicing stage would otherwise inject into the path. Scope.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":8,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/vincent212/kaspar-hft","note":null},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:39:33Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}