I built SEE, a schema-aware searchable compression format for JSON/NDJSON. It supports page-level random access and “exists/pos”-style lookups without full decompress + JSON parse.

Proof-first evaluation is fully offline:

10-minute demo pack

audit-grade DD evidence pack (repro checks)

BYOD kit (test on your own NDJSON locally)

Listed on Flippa (acquisition / exclusive license): https://flippa.com/12431275

Evaluation hub: https://gitlab.com/kodomonocch1/see_proto

Links: - Repo: https://github.com/kodomonocch1/see_proto - Release (Demo + DD packs): https://github.com/kodomonocch1/see_proto/releases/tag/v0.1.... - NDA / enterprise inquiry form: https://docs.google.com/forms/d/e/1FAIpQLScV2Ti592K3Za2r_WLU...

If you want to verify quickly: 1) Demo: run the offline Demo Pack (~10 minutes) 2) DD: confirm pack_verify PASS + mismatch=0 + audit PASS (see the release notes checklist)

Repro / proof pointers:

1) Demo pack (10-min): prints ratio/skip/bloom + lookup p50/p95/p99. 2) DD pack: strict decode mismatch checks across 3 datasets (mismatch==0) + run_metrics.json / SUMMARY.md.

If you want, I can share which query shapes we optimize for (exists/pos/eq) and why the “searchable-in-format” approach avoids the usual index consistency tax.