Three Ways to Make HyperCrux Faster: A C Search Loop, AltSql DB Underneath or a New Engine in C

Wed, 07 Oct 2026 00:00:00 +0000

HyperCrux 0.1 is a Go library and command on top of SQLite, and it’s quick at the sizes it was built for. In the recorded benchmarks on a two-core cloud machine, a get by key takes 18 microseconds and a walk one link out 43 microseconds. A search among 100,000 vectors of 384 values takes 0.41 seconds. The question that comes up next is how much faster it could get, and what each step would cost.

One SQLite File Instead of Three Databases: HyperCrux 0.1 Keeps Records, Links and Vectors Together

Tue, 06 Oct 2026 00:00:00 +0000

Add search by meaning to an app and the data splits in three. The records stay in the regular database. Their embeddings go to a vector database, so the app can find documents that are about the same thing as a question. The connections between records, who owns what and which document cites which, end up in a graph database or a join table nobody likes. Then something has to copy every change from one to the others, and the day it misses one, a search returns a document that was deleted last week.

Sqlite on HyperCrux.com

Three Ways to Make HyperCrux Faster: A C Search Loop, AltSql DB Underneath or a New Engine in C

One SQLite File Instead of Three Databases: HyperCrux 0.1 Keeps Records, Links and Vectors Together