01
Checks must actually run
Dedalus targets V6.0's execution gap: success booleans, a list of limit cases and baseline names can satisfy structural checks without showing that a candidate was tested. V6.1 decomposes the gap into solver execution, residuals, real timeouts, measured baselines and identity binding, then specifies required-route success contracts.
02
Required-route failure stays visible
When a user requests an algorithm, a supported mathematical candidate cannot satisfy the request instead. SuccessContract separates required and optional kinds, and aggregation checks every required route. Complete records, executable reports and warranted verdicts serve different roles; missing checks remain visible instead of being offset by an aggregate score.
03
From requirements to bound reports
The module flow extracts required routes from hard hints, then applies solver, limit and invariant checks or subprocess tests and numerical benchmarks. Strongest priors, equivalence and deltas carry candidate_id. Evidence relations distinguish mechanism, limit, implementation, baseline and background support. Aggregation refuses to let an optional success replace a required-route result.
04
Identity and execution records
Mathematical gates require passing limits, bounded residuals, an execution_proof_id and a candidate-specific strongest-prior delta. The subprocess runner uses isolated working directories, a sanitized environment and process timeouts. Benchmarks record candidate time, baseline time, speedup and correctness. These contracts address report mismatches and nontermination while remaining task-specific.
05
Module inputs and outputs
Inputs are required routes, candidate genomes, closest priors and task tests. Outputs include measured benchmarks, bound solver or execution reports, evidence relations and route verdicts. The source provides eight baselines across four algorithm task families and a finite-graph solver. Using these modules requires an explicit invocation path; the package name does not establish default integration.
06
Conceptual walkthrough: an algorithm request
Consider a request explicitly requiring algorithm code and benchmarks. Hard routing makes algorithm a required kind. A timed-out or incorrect candidate, or one lacking a verifiable prior delta, cannot be replaced by mathematical success. Test definitions show these negative cases, but the archive's main CLI has no Dedalus choice and still defaults to Archimedes.
07
Hardened modules, incomplete entry wiring
Compared with V6.0, several existence checks become measured conditions, positional matching becomes candidate-ID binding and aggregate verdicts become requirement-aware. The subsequent V6.2 audit still finds missing CLI integration and mathematics centered on a fixed graph-diffusion task. Dedalus is therefore a module-hardening stage rather than a complete default pipeline.
08
Implementation and test definitions
Inspected modules include finite-graph solving, limit evaluation, subprocess execution, benchmarking, delta verification and verdict aggregation. Acceptance tests target failed limits, empty deltas, actual solver changes and required-route failure. This review reads those implementations and test definitions without executing the archive, so historical validation descriptions are not presented as new test results.
09
Module-level scope
Real process timeouts and numerical solving show that checks can execute, not that arbitrary research equations are interpreted correctly or are original. The archive's default CLI and hardened modules must be read separately; finite-graph tasks do not stand for all mathematics. The reusable execution components leave two clear issues for the next version: entry wiring and candidate semantics.
Reading example · Explaining the workflow
Keeping required-route failure visible
A request for an algorithm, executable code and benchmarks.
- 01
Mark algorithm as a required kind.
- 02
Explicitly invoke the strict runner for correctness and timeout checks.
- 03
Bind baselines, timing and prior delta to the same candidate.
- 04
Return NO_PROMISING_REQUIRED_ROUTE when the required kind lacks support.
A module report with traceable failure reasons.
This is a module-contract walkthrough; the archive's default CLI does not route through Dedalus.
Changes in this version
Math gates
- Earlier approach
Limit-case counts and hand-written success fields
- This version’s approach
Passing conditions, residuals and execution IDs
Require results of actual checks
Program execution
- Earlier approach
Timeout and benchmark checks may be structural
- This version’s approach
Real subprocess limits and measured benchmarks
Block nontermination and incorrect output
Aggregation
- Earlier approach
Other routes can mask request failure
- This version’s approach
Success contracts constrain required routes
Align delivery with the request