Structure Synthesis

Use this contract for the concrete task. Apply a short relevant check for a small change; expand investigation when the failure, risk or requested artifact warrants it. Resolve facts from the repository and runtime before imposing a process. Delegation is optional and should answer a bounded unresolved question.

Generation contract

Declare the grammar, interface/shape rules, operator and resource ceilings, representation and candidate-identity semantics. Separate generation, legality verification and downstream utility evaluation when that separation is part of the system design. A search policy may legitimately use predicted utility; document its selection boundary and audit it rather than treating every guided search as invalid.

• Preserve representation round-trip fidelity and the grammar's operator/edge attributes. Topology-only isomorphism does not establish semantic equivalence.
• Apply cheap type/shape/acyclic checks before canonicalization; run the full gate on the canonical form. Reachability/dead-node treatment must agree with normalization rules.
• Canonicalize only under declared equivalences. Deleting a nonlinearity or overwriting a real edge during splicing changes semantics.
• Check idempotence and label/order invariance, including downstream-distinguished nodes and tied symmetric branches. Raw IDs must not silently decide canonical identity.
• Use an owned, versioned serialization/hash contract. Hash equality is not a proof of general program equivalence; define collision handling and the supported equivalence relation.
• Measure diversity after canonicalization and, where relevant, with functional probes. Distinct serializations can represent one candidate.
• Reverify mutations/recombinations and retain provenance of accepted, rejected and failed candidates. Selection bias and best-of-K claims need independent evaluation.
• Gate grammar expansion by rejection/verification cost and coverage evidence; larger search spaces are not automatically useful.

Evidence and output