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

Experimental line: evaluate reusable subgraphs per RFC 0022 (spec #129)

Aperta
#307 0 commenti 0 reazioni 0 assegnatari Vedi su GitHub

I maintainer di solito rispondono entro 1 giorno

Nessuno ha ancora preso questa issue.

Valutazione

Difficoltà
5/5
Tempo stimato
Più di una settimana
Idoneità per principianti
25/100
Tipo di issue
Funzionalità
Chiarezza
Abbastanza chiara
Stato di attività
Attiva
Stack tecnologico
go

Direzione di ricerca

Start with the revised specification record once its §5 bounds and §7 envelope align with the decision; this issue explicitly says the runtime work follows that text, not the initial Draft. Then read the graph engine and the project's graphs table, reviewed-set lock, and composite result envelope. Done means implementing the decided subgraph contract, including bounded expansion, transitive locking, and output dispositions, against the revised specification.

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

Descrizione

enhancement spec

The specification decided the reusable subgraph contract on Judgment-Pack/judgment-pack-spec#129 (2026-10-22), recorded as RFC 0022 (Judgment-Pack/judgment-pack-spec#135). The decision calls the runtime implementation a separate experimental line. This issue is that line's entry; it is not milestoned until the record's revision lands (the spec follow-up filed with this issue) and the bounds carry their numbers.

The contract as decided. A subgraph is a graph with a declared interface (inputs.facts, inputs.evidence, outputs, result), referenced by a parent node by name and pinned digest over the exact loaded bytes, expanded at load with prefixed node ids; no recursion, depth at most 4, the graph's node limit kept over the expanded graph; an expansion is recorded as such, so a copy is never mistaken for a reference; an inner unresolved disposition surfaces at the interface with its reasons, handoffs are collected under their originating node; a subgraph is reviewed and locked as its own artifact, and on the decided surface the reviewed-set lock covers the parent, every referenced subgraph and every pack, transitively.

Where it would live. The graph engine on the experimental surface; the project's graphs table beside the packs it declares; the reviewed-set lock's transitive coverage; the composite result envelope with Core §8.3 dispositions at every output boundary and the four §8.4 error classes unchanged.

Not before. The record's §5 bounds are being aligned with the decision (depth 4, node limit, schema maxima) and its §7 envelope with the routes decision; the engine follows the revised text, not the Draft as first landed.

Lingua principale
Go
Stelle
2
Fork
6
Merge medio
3h 11m
PR unite (30g)
82

Preparare l'ambiente

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 Judgment-Pack/judgment-pack-runtime

Tutte le issue di Judgment-Pack/judgment-pack-runtime

Issue simili

Altre issue su Go

Ricevi le nuove issue nella tua casella

Un breve riepilogo di issue GitHub adatte ai principianti.