Rayforce
A small embeddable engine in pure C that runs columnar analytics, graph traversals and recursive Datalog queries in one optimised plan.
- What it is
- Query engines,Graph databases
- Type
- Open source
- Made by
- Anton Kundenko, with Lynx Trading Technologies
- License
- MIT
- Facts checked
- 6 October 2026
What it is
Rayforce is a C library, plus a REPL binary, that you link into a program. You describe a query as a lazy graph of operations, either through the C API, through Rayfall (its own Lisp-like query language) or through Python bindings: scans, filters, joins, group-bys, window functions and graph steps such as expanding neighbours or finding shortest paths. Nothing runs until you execute it. A multi-pass optimiser first rewrites the whole plan, pushing filters and column choices down and passing selections sideways between joins and graph expansions. Element-wise parts are then compiled to bytecode and run over 1,024-row chunks that stay in the CPU’s L1 cache, spread across a thread pool. Graph edges are stored next to the tables as compressed sparse rows (CSR), indexed both forwards and backwards, so one query can aggregate columns and then walk relationships without handing data to a second system. Everything goes through its own memory allocator instead of malloc, and there are no external dependencies.
Tables live in memory or on disk as one file per column (splayed tables) or split into date partitions, the layouts kdb+ uses, memory-mapped and backed by a write-ahead log. It reads CSV in parallel and imports Parquet, has an IPC client and server built in, and an add-on speaks q’s IPC wire format. Rayforce is MIT licensed, written mainly by Anton Kundenko and co-developed with and sponsored by Lynx Trading Technologies. There’s no paid edition; a managed Rayforce Cloud is announced with no launch date. The current release is v2.11.0, from October 2026.
Why teams pick it
- Tiny and self-contained: pure C, one public header, zero dependencies, its own allocator
- Relational operators, graph algorithms (BFS, Dijkstra, PageRank, Louvain, worst-case-optimal joins), recursive Datalog and HNSW vector search share one optimiser
- kdb+-style on-disk tables: column files, date partitions, memory mapping and a transaction log
- MIT licensed, with bindings for Python, Rust and WebAssembly
Watch out for
- No SQL: queries are written in Rayfall, the C API or Python, so BI tools and SQL clients can’t connect
- Young and fast-moving: the reworked v2 line was first tagged in June 2026 and has had ten more minor releases since, with one author writing most commits
- Parquet support covers local files only; there’s no reading straight from object storage
- Prebuilt binaries only for Linux x86-64 and macOS arm64; elsewhere you build from source on a POSIX system
- A small community, and the production users it names are listed by the project itself
Alternatives
What all query engines have in common →
Amazon AthenaAWSAWS’s serverless SQL engine for data in S3: no cluster to run, and on-demand queries cost $5 per TB scanned.
Apache CalciteOpen sourceA Java framework with everything a database needs to understand a query (SQL parser, validator, relational algebra and a rule-based, cost-based optimizer) but no storage of its own, which Hive, Flink, Druid, Dremio, Beam and many other systems embed as their SQL front end and planner.
Apache ZeppelinOpen sourceA self-hosted web notebook where each paragraph runs through an interpreter: Spark, Flink, JDBC, Python and more. Maintained, but behind Jupyter and Databricks in reach.
GizmoSQLOpen sourceA database server that wraps DuckDB (or SQLite) and serves it to many clients over Arrow Flight SQL, with TLS and authentication.
HotdataCommercialA managed SQL engine for AI agents, built in Rust on Apache DataFusion and Arrow: each agent gets short-lived “instant databases” to load data into, then runs read-only SQL, vector, full-text and geospatial queries over an HTTP API or CLI.
IbisOpen sourceA Python dataframe API that compiles to SQL, so the same code runs on DuckDB on a laptop and on BigQuery, Snowflake, PostgreSQL or more than 20 other engines.
Spice.ai OSSOpen sourceA single-binary SQL engine in Rust, built on DataFusion and Arrow, that federates queries across databases, warehouses and lakes, keeps hot datasets in a local accelerated copy, and adds search and LLM APIs on top.
VeloxOpen sourceMeta’s open-source C++ execution engine library: it takes an already-optimized query plan and runs it with vectorized operators, and it is the engine inside Presto’s C++ workers (Prestissimo) and Apache Gluten’s native Spark.How it fits with other technologies
What Rayforce uses
A group-by and a recursive graph query in one Rayfall script · bash
brew install rayforcedb/tap/rayforce
cat > flows.rfl <<'EOF'
; columnar: total quantity per symbol
(set t (table [Symbol Side Qty]
(list [AAPL GOOG MSFT AAPL GOOG] [Buy Sell Buy Sell Buy] [100 200 150 300 250])))
(show (select {from: t by: Symbol Qty: (sum Qty)}))
; graph: every account that money from account 1 can reach
(set db (datoms))
(set db (assert-fact db 1 'pays 2))
(set db (assert-fact db 2 'pays 3))
(set db (assert-fact db 3 'pays 4))
(rule (reaches ?a ?b) (?a :pays ?b))
(rule (reaches ?a ?c) (?a :pays ?b) (reaches ?b ?c))
(show (query db (find ?b) (where (reaches 1 ?b))))
EOF
rayforce flows.rflOne engine, four kinds of query#
Each of these builds into the same lazy plan, so the optimiser sees the whole workload at once.
Columnar analytics
select, joins, windowsVectorised filters, radix-partitioned hash joins, group-bys, window functions, pivots and as-of joins over typed column vectors.
Graph algorithms
CSR storageBFS, DFS, Dijkstra, A*, PageRank, Louvain communities, betweenness and Leapfrog TrieJoin over edges stored as forward and reverse CSR arrays.
Datalog
recursive rulesFacts stored as entity, attribute, value triples; recursive rules give reachability and transitive closure, evaluated to a fixpoint.
Vector search
HNSWAn HNSW index with cosine, L2 and inner-product metrics; a where filter is pushed into the search so rejected candidates don’t use up result slots.
See it in a real stack
No architecture uses Rayforce yet. Drop it into the playground and wire it up yourself.Open playground →Benchmarks
How to read a benchmark →Where it came from2023–2026
Analytics stacks often split work between a columnar engine for tables and a separate library or service for graphs, each with its own data model, language and memory layout. Joining them means serialising data between processes, and no optimiser ever sees the whole pipeline. Rayforce was built on the bet that one engine, with one optimiser, one execution model and one allocator, could do both faster than the seam between two.
Anton Kundenko started Rayforce in February 2023 as a columnar database in pure C, with a Lisp-like language instead of SQL, aimed at financial and time-series data. Its vocabulary of splayed and partitioned tables and a q-style transaction log echoes kdb+ and its q language. Lynx, a trading technology firm, co-develops and sponsors it. Python, Rust and WebAssembly bindings followed in 2025. In April 2026 a large rework, the v2 line, rebuilt the aggregation engine and storage; the project now describes itself as columnar analytics and graph traversal in one pipeline. Its first tagged release, v2.1.0, came in June 2026, and the same month an add-on let it talk to q clients and servers. PeachQ, an open implementation of the q language, runs on it.
Why it’s built this way
- Pure C with no dependencies and its own allocator
- A buddy allocator with slab caches and per-thread heaps avoids
malloccontention, and a library with no third-party code can be linked into anything with a C FFI. - Graph traversals as operators in the same plan as joins
- Moving data between a table engine and a graph library costs serialisation on every step and hides the full query from the optimiser.
- A small Lisp-like language instead of SQL
- Rayfall keeps the syntax small, and its
select,updateandpivotforms map directly onto the engine’s operation graph.
Timeline
- 2023
Anton Kundenko starts Rayforce in February; MIT licensed from March
- 2025
Rust, Python and WebAssembly bindings
- 2026
April: the v2 rework; June: first tagged release, v2.1.0
- 2026
June: an add-on speaks q’s IPC wire format
- 2026
October: v2.11.0
- Rayforce: About (why it exists, design principles, author)
- Rayforce README at the pre-v2 tag (columnar vector database, Rayfall)
- Rayforce LICENSE commit: MIT (Mar 2023)
- Rayforce v2.1.0 release notes (first v2 release, q-style transaction log, Jun 2026)
- rayforce-q: q IPC wire-format client and server
- PeachQ: an open implementation of q built on Rayforce
Sources18 · facts checked 6 October 2026
- Rayforce README (pipeline, features, install, Lynx partnership, MIT)
- Rayforce home page (production users, Rayforce Cloud, IPC)
- Rayforce v2.11.0 release (Oct 2026)
- Rayforce releases
- Rayforce docs: Quick start (build, REPL, scripts, platforms)
- Rayforce docs: Graph storage (CSR, double-indexed relationships)
- Rayforce docs: Graph queries tutorial (Datalog, recursive rules)
- Rayforce docs: .parquet namespace (local Parquet input)
- Rayforce docs: Storage guide
- Rayforce docs: IPC guide
- Rayforce example: datalog.rfl
- Rayforce example scripts (as-of joins, windows, pivots, partitioned tables)
- Rayforce contributors on GitHub
- rayforce-py: Python bindings
- rayforce-rs: Rust bindings
- rayforce-wasm: WebAssembly bindings
- KX docs: Splayed tables (one file per column, partitioned tables)
- KX docs: Partitioned tables