Work · alternatives · 2026

24 alternatives to C++ order book matching engine (3.2M orders/SEC, ~320ns)

High-performance C++ matching engine with unified market simulation, live market data streaming, and a browser-based dashboard - eelixir/mercury

Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.

1
Match(it): A C++17 pattern-matching library with lots of good stuffs▲85
A lightweight single-header pattern-matching library for C++17 with macro-free APIs. Try it at https://godbolt.org/z/8YMr8Kz8j
2022 · github.com · its alternatives →
2
Binance Orderbooks Consumer in C++▲42
Library for algorithmic trading. Contribute to xreptoid/viperfish development by creating an account on GitHub.
2023 · github.com · its alternatives →
3
I built a small browser engine from scratch in C++▲146
Hi HN! Korean high school senior here, about to start CS in college. I built a browser engine from scratch in C++ to understand how browsers work. First time using C++, 8 weeks of development, lots of debugging—but it works! Features: - HTML parsing with error correction - CSS cascade and inheritance - Block/inline layout engine - Async image loading + caching - Link navigation + history Hardest parts: - String parsing(html, css) - Rendering - Image Caching & Layout Reflowing What I learned (beyond code): - Systematic debugging is crucial - Ship with known bugs rather than chase…
Jan 2026 · github.com · its alternatives →
4
Drogon – A C++14/17 based high performance HTTP application framework▲189
Drogon: A C++14/17/20 based HTTP web application framework running on Linux/macOS/Unix/Windows - drogonframework/drogon
2019 · github.com · its alternatives →
5
Historical order book reconstruction API for crypto markets▲78
Historical tick-level order book updates, trades, quotes, open interest, funding, liquidations, options chains and more. API access and downloadable CSV files. Real-time consolidated market data streaming API via client libraries that connect directly to exchanges
2019 · tardis.dev · its alternatives →
6
Fast Random Library for C++17▲52
Morning HN. Random number generation feels is a somewhat underrepresented topic in the C++ realm. There is a lot of questionable info about it found online and even the standard library is quite behind the times in terms of it's algorithms. It suffers from trying to accommodate sometimes impractical standard requirements and has several ways of getting significantly bad statistical results. This leaves a lot easily achievable performance & quality on the table. So, being a mathematician who mostly works with stochastic models and wants these models to run fast and well, I embarked on a…
2025 · github.com · its alternatives →
7
Tiny-vLLM – high performance LLM inference engine in C++ and CUDA▲205
Build your own high performance LLM inference engine in C++ and CUDA - a smaller version of vLLM - jmaczan/tiny-vllm
May 2026 · github.com · its alternatives →
8
A strongly-typed document DB that runs on any transactional KV store▲113
A strongly-typed document database that runs on any transactional key-value store. - losfair/RefineDB
2021 · github.com · its alternatives →
9
A first project in Rust – in-memory order book▲91
Contribute to connorwstein/exchange development by creating an account on GitHub.
2020 · github.com · its alternatives →
10
A 2D game engine in under 1000 lines of C▲98
A top-down 2d game engine, written from scratch in under 1000 lines of C. Development of the game based on this engine is streamed on Twitch: https://www.twitch.tv/ryanpcmcquen - ryanpcmcquen/basque
2020 · github.com · its alternatives →
11
Software Engineering Daily - Scaling PostgreSQL▲70
A look at modern database approaches and how Citus scales PG
2016 · softwareengineeringdaily.com · its alternatives →
12
Integer Map Data Structure▲91
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com · its alternatives →
13AG
A GPU-accelerated binary vector index▲65
This is a vector index I built that supports insertion and k-nearest neighbors (k-NN) querying, optimized for GPUs. It operates entirely in CUDA and can process queries on half a billion vectors in under 200 milliseconds. The codebase is structured as a standalone library with an HTTP API for remote access. It’s intended for high-performance search tasks—think similarity search, AI model retrieval, or reinforcement learning replay buffers. The codebase is located at https://github.com/rodlaf/BinaryGPUIndex.
2025 · rlafuente.com · its alternatives →
14
A threaded, TCP, key value store in Haskell▲63
A multi-threaded, TCP, key-value store inspired by Redis implemented in Haskell. - honza/redish
2013 · github.com · its alternatives →
15
Tantivy▲68
A full-text, horse-speed search engine library in Rust
2022 · github.com · its alternatives →
16
val – An arbitrary precision calculator language▲34
Wrote this to learn more about the `chumsky` parser combinator library, rustyline, and the `ariadne` error reporting crate. Such a nice DX combo for writing new languages. Still a work in progress, but I thought I'd share :)
2025 · github.com · its alternatives →
17
A benchmark + latency sim for LLM db queries: ClickHouse / Postgres▲12
Performance comparison of ClickHouse vs PostgreSQL using LLM-style query patterns on realistic aircraft tracking data - GitHub - 514-labs/LLM-query-test: Performance comparison of ClickHouse vs PostgreSQL using LLM-style query patterns on realistic aircraft tracking data
2025 · github.com · its alternatives →
18
Cppmatch – Rust-Like Pattern Matching and Error Handling for C++▲42
I've created cppmatch, a lightweight, header-only C++ library that brings Rust-inspired pattern matching and error handling to C++. It tries to imitate the functionality of the questionmark (?) operator in C++ by using a macro that uses the gcc extension https://gcc.gnu.org/onlinedocs/gcc/Statement-Exprs.html This allows to create exceptionless code with non-intrusive error-as-value that unlike Exceptions, makes it clear which kinds of error a function can generate and forces you to handle (or ignore) them. The ? operator translates to *expect* To handle the errors I…
2025 · github.com · its alternatives →
19
An expression parser supporting multiple types▲33
This C library is part of a main project aimed at providing a reactive key-value (KV) database. The data is typed (numbers, strings, dates, or booleans) and can include formulas with references to other entries. Clients connected to this database receive a real-time data stream with updates to the subscribed keys, allowing them to react to changes and their dependencies. Essentially, it’s like building a distributed Excel, where data and formulas dynamically update across the system. I couldn’t find any libraries that offered the full set of features I needed for evaluating expressions, so I…
2024 · github.com · its alternatives →
20
Timeplus Proton 3.0 – First vectorized streaming SQL engine▲11
Two years after open sourcing Proton, we're releasing v3.0 which brings enterprise-grade streaming capabilities to the open source version: full connectivity, processing, and routing in a single binary with zero dependencies. Key features: First vectorized streaming SQL engine in modern C++ with JIT compilation High-throughput, low-latency, high-cardinality processing End-to-end streaming: ETL, joins, aggregation, alerts, and tasks Native connectors: Kafka, Redpanda, Pulsar, ClickHouse, Splunk, Elastic, MongoDB, S3, Iceberg Native Python UDF/UDAF support to support your AI/ML work…
2025 · github.com · its alternatives →
21
A reimplementation of Google's sparsehash in C▲22
A simple re-implementation of Google's sparsehash as a learning excercise. - qpfiffer/Simple-Sparsehash
2015 · github.com · its alternatives →
22OA
Ordered – A sorted collection library for Zig▲21
I made an early version of a sorted collection library for Zig. Sorted collections are data structures that maintain the data in sorted order. Examples of these data structures are `java.util.TreeMap` in Java and `std::map` in C++. These data structures are mainly used for fast lookups (point search) and fast range searches. The library is available on GitHub: https://github.com/CogitatorTech/ordered
Oct 2025 · its alternatives →
23
IResearch – C++ search that beat Lucene and Tantivy on their benchmark▲15
The First Real-Time Search Analytics Database. Contribute to serenedb/serenedb development by creating an account on GitHub.
May 2026 · github.com · its alternatives →
24
Beating GCC 12 – 118x Speedup for Jensen Shannon D. Via AVX-512FP16▲8
SIMD-accelerated distances, dot products, matrix ops, geospatial & geometric kernels for 16 numeric types — from 6-bit floats to 64-bit complex — across x86, Arm, RISC-V, and WASM, with bindings for Python, Rust, C, C++, Swift, JS, and Go 📐 - Release Beating GCC 12 - 118x Speedup for Jensen Shannon
2023 · github.com · its alternatives →

Also compare

Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →