generate — deterministic search becomes reproducible evidence

The generation road turns a declared search into deterministic inputs and an honest account of every case it reached. The reduction road turns one recorded failure into a smaller reproducer without leaving that failure’s fingerprint. This parent composes those owners and preserves their established public roads without becoming a third semantic machine.

flowchart LR
    accTitle: Generation and reduction composition
    accDescr: Declared search material becomes a complete generation census, while a separately recorded failure enters fingerprint-preserving reduction and may earn a bounded replay capsule.

    plan[/Declared search/]
    source[(Seekable byte stream)]

    subgraph generation[Generation]
        direction TB
        draw[Draw bounded cases]
        decode[Decode structured inputs]
        account[(Complete case census)]
    end

    admitted[[Admitted sequences]]
    failure{{Recorded failure}}

    subgraph reduction[Reduction]
        direction TB
        propose[Offer smaller candidates]
        preserve{Same fingerprint?}
        evidence[(Reduction evidence)]
    end

    replay[[Bounded replay capsule]]

    plan --> source --> draw --> decode
    decode --> admitted
    decode --> account
    admitted -. executed and judged elsewhere .-> failure
    failure --> propose --> preserve
    preserve -->|yes| evidence --> replay
    preserve -->|no| propose

    classDef authority fill:#1f2937,color:#f9fafb,stroke:#111827,stroke-width:2px;
    classDef operation fill:#dbeafe,color:#1e3a8a,stroke:#3b82f6,stroke-width:2px;
    classDef evidence fill:#dcfce7,color:#14532d,stroke:#22c55e,stroke-width:2px;
    classDef decision fill:#fef3c7,color:#78350f,stroke:#f59e0b,stroke-width:2px;
    class plan,source authority;
    class draw,decode,propose operation;
    class account,admitted,evidence,replay evidence;
    class failure,preserve decision;

Deterministic search

A generated byte stream is addressed from declared input alone and can be read at any position without replaying the positions before it. Extending a search window therefore preserves the exact prefix already explored instead of renaming or reseeding it.

Generation keeps accounting separate from stopping posture. The census says what became of every reached case, while the halt says why the road ended, so rejected or unavailable work cannot disappear from the denominator.

Fingerprint-preserving reduction

Reduction begins from a failure already recorded by the report owner and admits a smaller candidate only when the bound probe reproduces the same fingerprint. Owner-supplied semantic candidates may lead the search, and the generic byte road continues under the same admission law and finite budget.

The result is the smallest input this declared reduction reached, not a claim of global minimality. A replay capsule is earned only after completed reduction evidence joins the report standing, input lineage, reducer custody, and replay ceiling.

Boundaries

Generation does not execute a subject or judge a command sequence. Reduction does not interpret bytes, choose owner-semantic candidates, or strengthen the reproduction authority carried by its inputs. Neither road reads a clock, environment, filesystem, network, or operating-system random source.

The exact constructors, bounds, disposition roster, identities, and callable seams live with their public items. The private generation and reduction homes own the two vocabularies and operation roads.