Brainstorm results: Jev use cases that have not been widely discussed

Date: 2026-10-01. Produced with the /swarm-brainstorm skill in Claude Code (Sonnet 5.5). This page holds the results. The development journey explains how the 14 subagents worked.

1. The question and the two runs

Jev is the first "System One" model from TypeSafe AI. It takes unstructured state and a typed question. It returns a typed answer (a choice among up to 255 options, a score, or a boolean) with probabilities, and never returns free text. The question for the brainstorm was: which use cases of Jev are not yet widely discussed?

The same prompt ran twice, on two different evidence bases.

RunEvidence baseSubagentsCandidatesChosen ideaRunner-up
1Open web research7 (3 + 4)20All-pairs contradiction scan of a policy corpusClause-ambiguity index
2Only the TypeSafe launch blog and the awesome-jev list7 (4 + 3)15Dead-letter-queue triage with a replay contractQuestionnaire pretest with synthetic respondents

The prompt asked every candidate to be judged from three views: the factual or evidentiary view, the reader view, and what other publications cover. The agents handled the first and third views. The reader view was a judgment that I made in the parent session. No reader test was run.

What Jev is, from the launch blog. Response time of 70 ms to 500 ms end to end. Input tokens at $0.042 per million, output tokens free. All outputs generated in parallel. Up to 255 choices per question. The blog calls its 0% type-error rate "non-empirical", and it names these uses: workflow routing, classification, scoring and extraction, map-reduce over large datasets, real-time applications, output verification, Doom, and wikiracing.

2. Run 1: open web research

2.1 What the first stage found

2.2 The 20 candidates

Angle (agent)CandidateNoveltyFate
Domains with zero coverageTranslation QA gateHighRejected (rank 7)
Permit application completenessMediumRejected (rank 9)
Manufacturing nonconformance report routingHighRejected (rank 6)
Archives access and retention reviewMedium to highRejected (rank 5)
Medical coding auditMediumRejected (rank 10)
Architectural roles inside other systemsJev as the comparator in a sortLowRejected (low-novelty group)
Jev as the failure oracle in delta debuggingMediumRejected (rank 2)
Production semantic assert, sampledLow to mediumRejected (rank 11)
Surrogate labeler for A/B pre-screeningLowRejected (low-novelty group)
Semantic-cache hit verifierLowRejected (low-novelty group)
Personal, science, civicClaim-versus-table check for papersLowRejected (low-novelty group)
Newsworthiness score for FOIA recordsLowRejected (low-novelty group)
Genealogy same-person matchingMediumRejected (rank 3)
Adjudication of volunteer transcriptionsHigh, on 2 queriesRejected (rank 8)
Stale-note checkerMediumRejected (rank 4)
Uses that depend on the probability outputClause-ambiguity indexMediumRunner-up (rank 1)
Phrase-level leakage probeLowRejected (low-novelty group)
All-pairs contradiction scan of a policy corpusMediumChosen
Label-noise audit with a stability gateLowRejected (low-novelty group)
Difficulty stratifier for test setsLowRejected (low-novelty group)

2.3 The chosen idea: contradiction scan of a policy corpus

  1. Split a corpus of policies into clauses, for example a handbook, terms of service, or a grant rulebook.
  2. Use embeddings to pick candidate pairs of clauses.
  3. Ask Jev one question per pair, in both orders: "contradict / consistent / unrelated".
  4. Flag a pair only when both orders say "contradict" with p of 0.7 or higher.
  5. Check numbers and dates in code, not in Jev. The vendor lists counting, math, and date comparison as failure modes.

Why it won. The both-orders rule turns a documented weakness into a filter. A community audit found that the first-listed option gains 0.37. A human can verify each flagged pair by reading two clauses. No page in the coverage map covers government or public-sector use, and the search found no Jev-specific contradiction scan.

Cost. About 400 million tokens for 1,000 clauses in both orders, which is about $17 at $0.042 per million. The vendor request limit of 40 per second applied to about 999,000 calls gives about 6.9 hours, so the request limit is the tighter constraint. Putting one clause in the shared state and asking up to 13 questions per call should reduce this. The vendor cookbook reports 10.0 times faster for 13 questions in one request.

Test. Use the LegalWiz documents with injected contradictions. Pass if recall is 0.70 or higher in the top 200 flagged pairs and precision@50 is 0.50 or higher. These thresholds are an agent's proposal.

2.4 Rejected candidates, ranked

  1. Clause-ambiguity index. Scores a clause by how much the answer changes under reworded questions. Brittleness of the model and ambiguity of the text are confounded, and the test needs human-labeled disputed clauses.
  2. Delta debugging with Jev as the oracle. An unstable oracle can drop the real cause of a failure.
  3. Genealogy same-person matching. Overlaps entity resolution, which is saturated. Common names are chance-like inputs.
  4. Stale-note checker. The audience is narrow.
  5. Archives access and retention review. A wrong "open" releases confidential material.
  6. Manufacturing report routing. No public dataset can test it.
  7. Translation QA gate. The vendor says English works best and other languages less well.
  8. Volunteer-transcription adjudication. The high novelty rating rests on 2 search queries.
  9. Permit completeness. Non-Jev vendors already sell it.
  10. Medical coding audit. A Jev prior-authorization proof of concept is adjacent.
  11. Production semantic assert. Test-time tools exist.
  12. Low-novelty group. Leakage probe, label-noise audit, difficulty stratifier, claim-versus-table check, FOIA scoring, sort comparator, A/B surrogate, cache verifier. Each has close prior art.

The agents dropped four ideas before they wrote them, because Jev work already existed: prior authorization, interview coding, short-answer grading, and bookkeeping.

3. Run 2: the launch blog and the awesome-jev list only

3.1 What the first stage found

Four agents each read a slice of the list's category files (167,674 bytes in total, about 552 entries by their hand tallies). They reported:

3.2 The 15 candidates

Angle (agent)CandidateNoveltyFate
Empty and thin domainsInsurance first-notice-of-loss routingHighRejected (rank 4)
Clinical-trial eligibility pre-screenHighRejected (rank 3)
Short-answer rubric scoringHighRejected (rank 12)
Shipment-exception handlingHighRejected (rank 5)
Product-taxonomy assignmentMediumRejected (rank 11)
Properties the blog stressesEntity resolution, one choice per recordMediumRejected (rank 10)
Root-cause hop navigation on a service graphMediumRejected (rank 8)
Dead-letter-queue triage with a replay contractHighChosen
Typed branch node in Airflow or TemporalLowRejected (rank 13)
Material-change classification of page versionsHighRejected (rank 2)
Cross-domain transfer from odd entriesNext-file prefetch from a recent-files listHighRejected (rank 14)
Local head for a voice end-of-turn decisionMediumRejected (rank 9)
Questionnaire pretest with synthetic respondentsHighRunner-up (rank 1)
Hazard-log risk mapMediumRejected (rank 6)
Hierarchical code assignment, one choice per levelMediumRejected (rank 7)

3.3 The chosen idea: dead-letter-queue triage with a replay contract

A message queue sends messages that keep failing to a "dead-letter queue". During an incident, thousands of these messages pile up, and an engineer sorts them by hand.

  1. A small consumer reads each failed message: error, headers, and payload, about 600 tokens.
  2. It adds about 30 known failure signatures, about 450 tokens.
  3. Jev answers one choice: replay, replay after fix N, quarantine, or page a human.
  4. Code enforces the contract. Only idempotent messages replay automatically, and Jev can never discard a message.

Why it won. The list has no entry for dead-letter queues. A grep of its README for "dead letter", "dlq", "kafka", "poison", "message queue", "rabbitmq", and "sqs" found no hit. The blog names workflow routing and real-time use, and the list has no streaming-operations entry. The worst error, a wrong replay, is blocked by the idempotency rule in code, so the design does not depend on Jev's probabilities being calibrated.

Cost. For one million messages at 1,050 tokens each, that is 1,050 MTok at $0.042, which is $44.10 for an incident hour. The token counts are an agent's assumption. The list's Jev for Physical AI entry reports $24.57 per million decisions, which is about 585 tokens per decision at the same price, a figure in the same range.

Test. Take 2,000 engineer-labeled messages. Pass if the replay class has 99% or higher agreement at p of 0.95 or higher, with 40% or higher coverage. Fail if any non-idempotent message is replayed automatically. The thresholds are an agent's proposal.

3.4 Rejected candidates, ranked

  1. Questionnaire pretest with synthetic respondents. Uses the wording sensitivity of Jev as the measurement. It rests on one list entry whose repository I did not open, and correlated synthetic respondents are the main risk.
  2. Material-change classification of policy or terms pages. The blog has no long-context benchmark, and a missed change is the costly error.
  3. Clinical-trial eligibility pre-screen. The list's medical entries are exams and hallucination tests. A wrong "not met" removes an eligible patient.
  4. Insurance first-notice-of-loss routing. New industry on a routing pattern that the list already covers heavily.
  5. Shipment-exception handling. Same problem. The nearest entry is warehouse robot triage.
  6. Hazard-log risk map. Depends on score ordering, and the list records a ranking benchmark that failed four of six conditions.
  7. Hierarchical code assignment. Errors compound: 0.9 per level gives 65.6% over four levels.
  8. Root-cause hop navigation. An existing entry uses the method on a knowledge graph. 0.9 per hop gives 59% over five hops.
  9. Voice end-of-turn local head. Adapts the list's stuntd pattern. Voice turn-taking appears as a demo.
  10. Entity resolution with one choice per record. Costs $1,722 for 10 million records against $5,040 for pairwise questions. The list already has a pairwise tool.
  11. Product-taxonomy assignment. The mechanism is shown on other item types.
  12. Short-answer rubric scoring. The list records a subjective-scoring test where no model beat the label base rates.
  13. Airflow or Temporal branch node. Only the engine names are new.
  14. Next-file prefetch. A plain recency rule likely wins.

The agents dropped systematic-review screening, support-ticket routing, and spam moderation before ranking, because the list covers them.

4. Comparing the two runs

5. What is not verified