Exact certification of AI-discovered quantum codes and circuits

Search-based and learning-based pipelines now publish catalogs of quantum error-correcting codes and of optimised hardware designs. The reported code distances and design equivalences are usually obtained by bounded or heuristic methods. We re-examine two such releases with exact methods: a catalog of 467 bivariate-bicycle-type codes, and a set of ShinkaEvolve-optimised RTLLM Verilog designs. The great majority of claims are confirmed. We identify a small number of cases where the exact value differs from the reported one, give certified replacement codes, and report exact distances for several codes whose published distances were lower bounds. We also report a null result for a selection-concentration hypothesis.