Hacktoberfest 2026: le issue che i maintainer hanno segnato per ottobre, aperte e adatte ai principianti. Sfoglia le issue Hacktoberfest

L1/L2: cheap pre-filter for provably routine calls (gated on measurement)

Chiusa
  • Qualcosa non va?
#34 2 commenti 0 reazioni 0 assegnatari Vedi su GitHub

I maintainer di solito rispondono entro 1 giorno

Nessuno ha ancora preso questa issue.

Valutazione

Difficoltà
4/5
Tempo stimato
3-5 giorni
Idoneità per principianti
48/100
Tipo di issue
Funzionalità
Chiarezza
Abbastanza chiara
Stato di attività
Attiva
Stack tecnologico
bash, typescript
Ambito
cli, security

Direzione di ricerca

Start with the measurements from #17 and the current 92-case adversarial report to determine whether the stated gate is met. Then locate the deterministic recognizer and full harness, and verify the listed acceptance conditions: pure-function tests for verbs and disqualifiers, zero under-flag delta, and under-1ms added latency.

Scritto dal modello di indicizzazione a partire dal testo della issue.

Descrizione

enhancement ready-for-agent

This was generated by AI during triage.

Cheap pre-filter for provably routine calls

Layer: L1 (recognition) + L2 (judgment). Gated on measurement: do not build until #17 numbers justify it.

Cost structure today: every novel command costs one full model round-trip. The session cache removes repeats, but a heavy session still makes dozens of novel calls, and the harness shows the model spends most of them agreeing.

The peer project's architecture: stage one is a 16-token filter that can only say "clearly routine" or "look closer", and is never allowed to refuse; stage two is the full review. Splitting them keeps the common case cheap without letting the cheap case decide anything consequential.

Our version has a better stage zero available: the deterministic layer already knows things the model cannot. A structurally routine recognizer (single-segment command, verb on a read-only verb list, no redirects, no substitutions, no writes, no network tokens) can clear the long tail with zero model cost and zero risk of a wrong allow, because the shape is provably inert. Only the remainder reaches the model. A model-side stage-1 filter is the fallback for shapes the recognizer cannot prove.

Ordering to preserve: critical patterns and the eval spawn scan outrank any fast path. The recognizer can only clear, never refuse. Fail-open there is safe because everything it clears is provably inert by construction, and everything else classifies exactly as today.

Measured gate for building it: from the current adversarial report, compute what fraction of the 92 cases the recognizer would clear and how many of those are labeled allow. Build only if it clears a meaningful share (target: >30% of corpus volume) with zero allow-labeled misses in a full harness run.

Acceptance:

  • Recognizer is a pure function with unit tests over the verb list and every disqualifier.
  • A full harness run with the fast path enabled shows zero under-flag delta.
  • Latency: fast-path decisions add no measurable per-call overhead (<1ms).
Lingua principale
TypeScript
Stelle
0
Fork
1
Merge medio
3h 35m
PR unite (30g)
50

Preparare l'ambiente

Questo progetto non fornisce container di sviluppo, Dockerfile né guida per i contributori, quindi l'ambiente è a tuo carico: parti dal suo README e consulta la nostra guida al primo contributo per i passaggi generali.

Come iniziare

  1. Leggi tutta la issue e poi la guida ai contributi del progetto.
  2. Commenta sulla issue per dire che te ne occupi tu — evita che due persone facciano lo stesso lavoro.
  3. Fai un fork del repository e lavora su un branch.
  4. Apri una pull request che faccia riferimento al numero della issue.

Altre issue di STRML/omp-classifier

Tutte le issue di STRML/omp-classifier

Issue simili

Altre issue su TypeScript

Ricevi le nuove issue nella tua casella

Un breve riepilogo di issue GitHub adatte ai principianti.