An independent check of the local Fourier compiler in OpenAI's preprint 'An explicit power saving for the exact discrete Fourier transform'
Authors/Creators
Description
Local Fourier Compiler Verification and Reproducibility Package
First public software and data release of the independent verification study by Oleksandr Pylypenko (ORCID: https://orcid.org/0009-0004-9610-9242), under the Apache License 2.0.
Scope and evidence
This package implements and tests the local Fourier compiler described in OpenAI's preprint An explicit power saving for the exact discrete Fourier transform. It provides exact-field checkers, numerical diagnostics, fixed-topology depth and cost measurements, and reproducible experimental data.
- Exact computational equality in cyclotomic fields at selected widths r = 4, 7, 8, 9, 12, 15, 16, 32; the C-slot path at r = 4, 8, 16.
- Finite-field checks at selected larger widths. The separate streaming test at r = 1024 checks the same two vectors in two finite fields (4096 output coordinates, zero mismatches). This is a necessary-condition test, not a proof of the full complex matrix or of C-slots at r = 1024.
- High-precision and float64 measurements quantify numerical instability; phase diagnostics measure bounded sensitivity, not a complete causal decomposition of rounding error.
- The completed core reproduction run contains 135 successful steps. Frozen
logs, manifest, data and checks are included, together with instructions and
pinned Python dependencies. The captured-source copy itself is omitted as
documented in
release/evidence/README.md. - OpenAI's Lean formalization was recompiled and its statement audited. It
proves the bound using a different network; this is not certification of
the concrete
network.texconstruction or an independent proof-body audit.
The package proposes no new DFT algorithm. Local finite experiments do not verify the global tensor network, synthesis or main asymptotic saving. The preprint makes no finite-precision claim.
Verification of this package
- 123 unit tests passed.
- 1531 full checks of numerical table claims passed, with no failures or omissions.
- Repository checksum manifest verified.
- Frozen completed-run evidence is preserved byte-for-byte; historical absolute paths describe the original execution machine and are not portable commands.
Manuscript status
English and Ukrainian LaTeX/PDF working drafts are included. This is a software and data release; full manuscript content and visual QA and a separate paper publication/identifier remain pending. The software DOI should cite this version of the computational package.
See README.md, CITATION.cff, paper/README.md and
release/README_REPRODUCE.md for citation, scope and reproduction instructions.
Notes
Files
cyberdid/fft-power-saving-verification-v1.0.0.zip
Additional details
Related works
- Is supplement to
- Software: https://github.com/cyberdid/fft-power-saving-verification/tree/v1.0.0 (URL)
Software
- Repository URL
- https://github.com/cyberdid/fft-power-saving-verification