Services
Delivery models and flagship work
Alopex Family
Asopitech Labo
NiminoDesktop
A lightweight WebView desktop foundation in Nim
NimculusEditor
A GPU-native editor in Nim and Metal
PoieraPlatform
A control plane concept for AI agents, carrying compact contracts through authorization, deployment, and verification
TheatoraBackend
A composable backend construction kit concept for swapping providers, runtimes, and topology
RhyzoraFramework
A concept for building CLI, TUI, Web, desktop, and MCP interfaces from declarative contracts
Labo overview
What the R&D lab is working on
Enterprise plans
Guides & material
Technical validation, PoCs & contract developmentEngineering
Turn data, analytics, RAG, and data-platform questions into working evidence
Startup database choices
Keep the same data file from MVP as your scale changes
Asopitech VS series
Comparisons with other products
Asopitech With series
Build with Asopitech products
Case studies
How it is built and operated
Browse by goal
Material, docs, and entry points
How does WITH RECURSIVE iterate, and where does it stop? This article reads the Alopex DB implementation alongside PostgreSQL, SQLite, and DataFusion.
Use CASE expressions, UNION and other set operations, common table expressions, rankings, and running totals in Alopex DB.
Create a table and query it with SELECT, JOIN, aggregation, and subqueries, then combine SQL and key-value data in one transaction.
An analysis of how database requirements change across the MVP, PMF, growth, and scale stages, comparing the trade-offs of SQLite, Postgres, managed databases, and dedicated vector stores — and where Alopex DB's 'erase the migration cliff' approach fits.
The family of algorithms for the crash failure model, where nodes stop but do not lie. From the single tool Paxos relies on — quorum intersection — through Raft's decomposition, EPaxos, Multi-Raft, and the parts outside the papers: persistence ordering and linearizable reads, with minimal code. Part 2 of a 4-part series.
SQLite, DuckDB, PostgreSQL, distributed DBs, vector DBs, graph DBs — there is no shortage of great products. I'm building a new database anyway because every time the project moves forward, I re-pick the DB and rebuild the data itself. Alopex DB aims to be a foundation that keeps data's volume, conversion time, regeneration cost, and provenance intact as you scale from local to cloud, from single node to distributed.
The myth that 'Rust can do anything' collapses the moment you try to scale a recursive AST. For SQL parsers — massive tagged unions, deep recursion — Rust's type system breaks down in both compile time and maintainability. A 3-language benchmark porting the same parser to Nim and Roc shows exactly why Rust is structurally the wrong tool, with runnable code.
A technical look at Roc — Richard Feldman's pure functional language. Covering the alpha4-rolling status, Perceus reference counting, the Platform/Host model, and the Zig compiler rewrite, informed by AlopexDB's SQL parser trial.
A technical overview of Nim in 2026 — the stable 2.2 series, the upcoming 3.0 (Nimony) compiler rewrite, ORC memory management, C ABI interop, and its real-world performance as an SQL parser candidate for AlopexDB.
How does WITH RECURSIVE iterate, and where does it stop? This article reads the Alopex DB implementation alongside PostgreSQL, SQLite, and DataFusion.
Use CASE expressions, UNION and other set operations, common table expressions, rankings, and running totals in Alopex DB.
Create a table and query it with SELECT, JOIN, aggregation, and subqueries, then combine SQL and key-value data in one transaction.
An analysis of how database requirements change across the MVP, PMF, growth, and scale stages, comparing the trade-offs of SQLite, Postgres, managed databases, and dedicated vector stores — and where Alopex DB's 'erase the migration cliff' approach fits.
The family of algorithms for the crash failure model, where nodes stop but do not lie. From the single tool Paxos relies on — quorum intersection — through Raft's decomposition, EPaxos, Multi-Raft, and the parts outside the papers: persistence ordering and linearizable reads, with minimal code. Part 2 of a 4-part series.
SQLite, DuckDB, PostgreSQL, distributed DBs, vector DBs, graph DBs — there is no shortage of great products. I'm building a new database anyway because every time the project moves forward, I re-pick the DB and rebuild the data itself. Alopex DB aims to be a foundation that keeps data's volume, conversion time, regeneration cost, and provenance intact as you scale from local to cloud, from single node to distributed.
The myth that 'Rust can do anything' collapses the moment you try to scale a recursive AST. For SQL parsers — massive tagged unions, deep recursion — Rust's type system breaks down in both compile time and maintainability. A 3-language benchmark porting the same parser to Nim and Roc shows exactly why Rust is structurally the wrong tool, with runnable code.
A technical look at Roc — Richard Feldman's pure functional language. Covering the alpha4-rolling status, Perceus reference counting, the Platform/Host model, and the Zig compiler rewrite, informed by AlopexDB's SQL parser trial.
A technical overview of Nim in 2026 — the stable 2.2 series, the upcoming 3.0 (Nimony) compiler rewrite, ORC memory management, C ABI interop, and its real-world performance as an SQL parser candidate for AlopexDB.
