CQ-SAT/GCC v0.25.0

CQ-SAT/GCC v0.25.0 broadens the evaluation surface and tests whether causal explanation can finally amortise continuation-quotient preparation.

The release adds strict original-format binary AIGER support across every AIGER command. Checked little-endian base-128 delta decoding reconstructs implicit inputs, latches, and AND gates, then passes the result through the same topology and semantic validation used for ASCII. Malformed, truncated, overflowing, extended, or oversized inputs fail closed. The binary fixture is semantically compared with ASCII and independently accepted by Yosys on Linux and macOS.

The new compile-once causal batch builds one maximum-horizon transition CNF and at most one continuation quotient, then explains every reachable frame/output failure. It tests maximal segments, individual points, and dyadic constant intervals; uses an exact bounded subset map to enumerate distinct 1-minimal causes; replays the identical transcript through persistent CDCL and CQ; reports workload-wide measured/projected break-even; and ships an independent verifier that rejects missing, duplicate, altered, non-sufficient, or non-minimal rows.

The first infusion-pump run is deliberately reported as a negative performance result: eight reachable targets produced 24 complete rows, 35 minimal causes, and 619 discovery queries. All causes verified, but CQ showed neither a measured nor projected crossover after 100 transcript repetitions. Persistent CDCL remains the practical default for this workload.

Validation includes 79 Rust tests, clean RustSec audit and package verification, Yosys interoperability, Rust 1.97 Bookworm tests, the public RTL differential corpus, and all required GitHub checks.

CQ-SAT/GCC remains an evaluation-ready research prototype—not a production-grade product and not evidence of a novel causal algorithm. Independent scholarly review and representative design-partner evidence remain open gates.