wizenheimer/blaze — explained in plain English
Analysis updated 2026-07-17 · repo last pushed 2025-10-14
Add embedded full-text search to a Go application without running a separate search server.
Learn how inverted indexes and BM25 ranking work by reading approachable, readable code.
Build a hobby project that needs phrase, proximity, or boolean search queries.
Study skip lists and roaring bitmaps as used in a real search engine implementation.
| wizenheimer/blaze | tastyeffectco/sandboxes | mitchellh/panicwrap | |
|---|---|---|---|
| Stars | 534 | 476 | 453 |
| Language | Go | Go | Go |
| Last pushed | 2025-10-14 | — | 2024-04-05 |
| Maintenance | Quiet | — | Dormant |
| Setup difficulty | easy | moderate | easy |
| Complexity | 3/5 | 4/5 | 2/5 |
| Audience | developer | developer | developer |
Figures from each repo's GitHub metadata at analysis time.
Educational project, not intended for massive production scale, use something like Bleve for that instead.
Blaze is a small, readable full-text search engine in Go that runs inside your app and ranks results with BM25, built for learning how search engines work rather than massive-scale production use.
Mainly Go. The stack also includes Go, BM25, Skip lists.
Quiet — no commits in 6-12 months (last push 2025-10-14).
Setup difficulty is rated easy, with roughly 30min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
double-check against the repo, no cap.