jevbooks

← All projects

jev-tree

reachjalil/jev-tree · Homepage

Recursive Jev choice over taxonomies larger than 255 options.

What it is

jev-tree lets you select among thousands of leaves by walking a JSON tree and calling Jev once per level or partition, working around TypeSafe Jev's 255-option choice cap. For developers with large catalogs.

How it uses Jev

At each tree level, Jev chooses among up to maxFanout options (default 32) given the state and question. The selected id is mapped back and the walk continues until a leaf is reached; its value is returned. Failures return reason 'unavailable'.

Primitives:choice

Technique worth stealing

Recursive choice over a taxonomy, auto-partitioning oversized sibling lists into labeled buckets.

Try it

npm install jev-tree; npx jev-tree for offline demo, or --live with AI_GATEWAY_API_KEY.

View on GitHub

judged by Jevjev-1.13.0

Evidence

Each line is one question put to Jev about the README. ≥ 0.60 reads as yes, ≤ 0.40 as no; in between Jev is not making a call.

  • Jev-centricyes0.96
  • Shows a System One patternyes0.72
  • Handles uncertaintyno0.03
  • Measuredno0.05
  • Runnableyes0.84
  • Worth recommendingyes0.61
  • Model replicano0.03
  • Problem scopescore on a 0–2 scale1.00
  • About Jevyes0.98

Signals by Jev jev-1.13.0, card written by DeepSeek V4.1 Flash from the README on 20 Sept 2026.