Architecture Blueprint
Build Your Own Jev: Open-Source System 1 Decision Engines
When TypeSafe announced Jev as a breakthrough built in stealth for two years, the AI community responded with code in two hours. You do not need proprietary weights or closed APIs to run deterministic, sub-35ms typed decision primitives. Here is how parallel constrained scoring works, how the open-source alternatives compare, and how to build one yourself.
You do not need to pre-train a model from scratch. Jev's core mechanism is non-autoregressive parallel option scoring: instead of generating JSON text token-by-token (taking 500ms–2s), a small pre-trained transformer (such as Qwen-2.5-1.5B or ModernBERT-large) performs a single forward pass. Candidate choices are constrained by logit masking, and a softmax over those candidate tokens produces an instant categorical choice and calibrated confidence score in 15–35 milliseconds.
Active open-source reproductions include Laya (ModernBERT-large), openjev-sglang (high-concurrency SGLang backend), Drex (lightweight edge runtime), AnyJev, VON, and Qwen-RLCD.
The "Two Years vs. Two Hours" Debate
In mid-September 2026, TypeSafe released Jev as the first dedicated "System 1" model for software agents. Founders Diogo Almeida and team promoted Jev's speed (20–200x faster than GPT-4), low cost ($0.042/1M tokens), and mathematically bounded output schema.
Within hours of the launch announcement, independent engineer Harsha Gundala published a working replica using Qwen-2.5-1B with the viral note: "Built in stealth for 2 years vs stealth for 2 hours." Shortly after, Jared Palmer launched Kev, Convai released Laya on ModernBERT-large weights, and projects like openjev-sglang and Drex emerged on GitHub and X (Twitter).
This explosion revealed an industry-wide open secret: structured classification is not generative text. By cutting out generative decoding loops, any team with an open-weights model and basic PyTorch knowledge can build a production-grade decision router.
Architecture: Autoregressive LLM vs. System 1 Router
Understanding how Jev and its replicas work requires contrasting the computational path of an autoregressive model against a parallel decision primitive:
| Dimension | Generative LLM (System 2) | Decision Engine / Jev Primitive (System 1) |
|---|---|---|
| Execution Flow | Sequential autoregression (Token 1 → 2 → 3... {"choice": ...) | Single forward pass over the input prompt |
| Inference Latency | 400 ms – 2,500 ms (depends on output token count) | 15 ms – 35 ms (constant time regardless of task) |
| Output Space | Unconstrained vocabulary (32,000–128,000 token possibilities) | Constrained candidate set (e.g. 5 bounded categories) |
| Failure Mode | JSON syntax hallucination, schema parsing failure, key truncation | Zero syntax errors (enforced by logit masking) |
| Confidence Calibration | Verbalized ("I am 90% sure"), notoriously miscalibrated | Softmax log-probabilities over constrained option logits |
Hosted Jev vs. Open-Source Local Alternatives
Today's landscape is no longer limited to TypeSafe's proprietary API or Convai's Laya. A rich ecosystem of local decision engines has materialized across different parameter scales and serving backends:
| System | Architecture & Base | Params | P50 Latency | License & Deployment | Key Strengths & Limitations |
|---|---|---|---|---|---|
| TypeSafe Jev (Cloud) TypeSafe AI (Diogo Almeida) | Proprietary Transformer + RLCD | Undisclosed (~1B–3B) | 200–280 ms (hosted WAN) | Proprietary ($0.042/1M tokens) | + Zero infra setup; 1K–10K context #1 on OpenRouter; up to 255 choice options; strong zero-shot baseline. − WAN network latency; mandatory data egress; closed weights and recurring API billing. |
| Laya Convai Innovations (Nandha Kishor M) | ModernBERT-large Encoder | 421M | 32.8 ms (Local T4 GPU) | Apache-2.0 | + True non-autoregressive encoder; 0.081 ECE calibration; 45+ languages; batched 7.2ms/query. − Option token budget degrades beyond ~20 choices (e.g. Banking77 drops to ~0.425). |
| openjev-sglang Plattypuus & Community | Qwen-2.5 / Llama-3 + SGLang | 0.5B – 7B | 18 – 45 ms (Local Engine) | Apache-2.0 / MIT | + Radical inference speed via RadixAttention and constrained logit forward masking; extreme concurrent throughput. − Requires Python + SGLang server deployment with CUDA dependencies. |
| Drex Alex Prompter & Independent Devs | DistilBERT / MiniLM Head | 66M – 135M | 8 – 15 ms (Local CPU / Edge) | MIT | + Ultra-compact footprint; runs directly inside Node.js / ONNX web runtimes without dedicated GPU. − Narrow classification scope; weak complex contextual reasoning compared to 1B+ models. |
| AnyJev WQU Guru Ecosystem | Multi-Backend Adapter (Ollama/vLLM) | Configurable (1B–8B) | 35 – 80 ms (Local vLLM) | MIT | + Drop-in API replacement for typesafe SDK; supports hot-swapping Qwen, Gemma, and Mistral backends. − Latency depends heavily on underlying engine setup and local GPU memory allocation. |
| VON (Virtual Output Nodes) AI Geek News / Community | Pre-allocated Option Embeddings | 1.5B (Qwen base) | 25 – 40 ms (Local GPU) | Apache-2.0 | + Maps choices directly into fixed virtual token IDs, avoiding prompt template parsing overhead. − Dynamic runtime option expansion requires re-indexing option heads. |
| Qwen-2.5-1B-RLCD Harsha Gundala | Qwen-2.5-1B-Instruct + Masked Head | 1.0B | 28 – 50 ms (Local T4) | Apache-2.0 | + Pioneered the viral 'built in stealth for 2 hours' reproduction; proven zero-shot logit extraction blueprint. − Experimental proof-of-concept without enterprise long-term SLA maintenance. |
| CLM-8B Nullsoft App Research | Llama-3.1-8B-Instruct Base | 8.0B | 60 – 110 ms (Local A10G) | Community Open Weights | + Deep semantic comprehension on complex ambiguous contracts; resilient against adversarial distraction. − Demands higher VRAM (16GB+) and exhibits higher latency than sub-1B models. |
Build Your Own: 30-Line Python Implementation
Here is a self-contained, working Python prototype utilizing Qwen/Qwen2.5-1.5B-Instruct. It loads the base weights locally, injects target routing candidates into prompt context, masks next-token logits, and yields calibrated probabilities with zero token decoding loops:
# build_your_own_jev.py
# A 30-line System 1 Decision Primitive using HuggingFace & PyTorch
import torch
from transformers import AutoModelForCausalLM, AutoTokenizer
import torch.nn.functional as F
class LocalJevRouter:
def __init__(self, model_id: str = "Qwen/Qwen2.5-1.5B-Instruct"):
print(f"Loading local System 1 decision engine: {model_id}...")
self.tokenizer = AutoTokenizer.from_pretrained(model_id)
self.model = AutoModelForCausalLM.from_pretrained(
model_id,
torch_dtype=torch.float16,
device_map="auto"
)
def route(self, prompt: str, candidates: list[str]) -> dict:
# Format single prompt framing options as explicit categorical letters
letters = ["A", "B", "C", "D", "E"][:len(candidates)]
options_text = "\n".join([f"{letter}: {opt}" for letter, opt in zip(letters, candidates)])
input_text = f"Analyze task and select best category letter.\nTask: {prompt}\nOptions:\n{options_text}\nSelected Letter:"
inputs = self.tokenizer(input_text, return_tensors="pt").to(self.model.device)
with torch.no_grad():
outputs = self.model(**inputs)
# Inspect next-token logits from the final forward pass
next_token_logits = outputs.logits[0, -1, :]
# Extract logits strictly for candidate letters
candidate_token_ids = [self.tokenizer.encode(letter)[-1] for letter in letters]
option_logits = next_token_logits[candidate_token_ids]
# Softmax across candidate options to obtain calibrated probability distribution
probabilities = F.softmax(option_logits, dim=-1).cpu().tolist()
best_idx = int(torch.argmax(option_logits))
return {
"choice": candidates[best_idx],
"confidence": round(probabilities[best_idx], 4),
"distribution": {cand: round(prob, 4) for cand, prob in zip(candidates, probabilities)}
}
# Usage Example:
if __name__ == "__main__":
router = LocalJevRouter()
result = router.route(
prompt="Review pull request #402 for memory leak vulnerabilities",
candidates=["code_search", "test_runner", "docs_lookup", "code_review", "none"]
)
print("Decision Output:", result)
# Output: {'choice': 'code_review', 'confidence': 0.9642, ...}Enterprise Use Cases & Performance Benchmarks
In production architectures, decision primitives are deployed ahead of heavy reasoning agents to filter, classify, and guardrail input. TypeSafe published verified benchmark gains illustrating where System 1 models excel:
Duplicate Task Matching
Matching incoming customer issues against existing bug reports. TypeSafe measured accuracy surging from 70% → 97% compared to traditional cosine embedding similarity.
Expense & Invoice Triage
Classifying line items into tax categories. Benchmark accuracy climbed from 50% → 86% when shifting from generic few-shot prompts to calibrated decision heads.
Shadow Execution Speedup
Running routing primitives in parallel shadow mode behind live agents demonstrated a 4x speed advantage over asynchronous tool-calling LLMs.
Verified Community Insights from X (Twitter)
The rapid development of local System 1 engines is extensively documented by engineers and founders across X:
"Built in stealth for 2 years vs stealth for 2 hours. Here is Qwen-2.5-1B with parallel constrained decoding matching Jev routing."
"Jev reaches #1 on OpenRouter context brackets 1K–10K. Fast non-autoregressive classification is the missing layer for autonomous software workflows."
"Benchmarking AnyJev against Laya and hosted Jev. Local GPUs solve the privacy constraint, but broad-choice datasets require careful temperature scaling."
"Openjev on SGLang RadixAttention backend achieves sub-20ms P50 latency. For high-throughput agent swarms, self-hosting is an absolute no-brainer."
Test Your Decision Thresholds with Empirical Evidence
Whether you run hosted Jev or self-host Laya, Drex, or openjev-sglang, raw model scores never guarantee zero errors. Test how threshold adjustments trade off auto-adoption against safe handoffs on real validation samples in JevLab.
Frequently Asked Questions
Do you need 2 years to train a System 1 decision model like Jev?
No. While TypeSafe trained Jev from scratch with extensive proprietary reinforcement learning (RLCD), open-source engineers like Harsha Gundala demonstrated that an existing pre-trained model (such as Qwen-2.5-1B or ModernBERT-large) can be adapted in hours. By scoring pre-defined candidate options through parallel logit masking in a single forward pass, you achieve deterministic typed decisions without autoregressive token generation.
How does parallel logit scoring differ from standard LLM JSON mode?
Standard LLM JSON mode generates tokens sequentially (token 1 -> token 2 -> token 3), incurring hundreds of milliseconds of latency, token-based API costs, and risk of syntax truncation. In contrast, parallel logit scoring runs a single forward pass to compute log-probabilities across candidate option tokens simultaneously, normalizing them via softmax in <35ms with zero syntax errors.
What open-source local alternatives to Jev exist today?
The local ecosystem includes Laya (Convai, ModernBERT-large 421M), openjev-sglang (SGLang high-throughput backend), Drex (minimalist edge decision runtime), AnyJev (multi-backend adapter), VON (Virtual Output Nodes architecture), Qwen-2.5-1B-RLCD (reproducible zero-shot prototype), and CLM-8B.
When should an engineering team build their own Jev instead of using the TypeSafe API?
Self-hosting is ideal when data privacy is strict (HIPAA, zero VPC egress), p50 latency must stay below 40ms for high-frequency voice or IDE agents, and query volume is high enough that cloud API fees exceed local GPU hosting. Hosted Jev is better when you need zero infrastructure maintenance, support for up to 255 choice options, and out-of-the-box long-context reasoning.
How do you evaluate and tune a custom self-built decision router?
A decision router is only as good as its confidence threshold policy. Rather than guessing cutoffs, run your self-hosted model against labeled evaluation benchmarks (such as JevLab's 5-outcome suite), measure your empirical Auto-Adopt vs Handoff curves, and configure fail-closed guardrails.