# Human assessment worksheet

Manuscript: *An explicit power saving for the exact discrete Fourier transform*, September 25, 2026, 31 pages. Assessment is pending. This worksheet contains no panel verdicts.

1. State the exact computational contract: supplied root, permitted field operations, integer word operations, coefficient restrictions, and preparation costs.
2. Reconstruct the eight-row incidence identity and its three-stage signed bank exchange. Does it restore arbitrary auxiliary contents?
3. Check every binary-label subspace transition and residual dimension. Recompute W, Δ, the power-of-two padding, and the terminal transform on every role.
4. Derive the exact normalized recurrence and check divisibility of every recursive batch. Are initialization, indexing and workspace charged consistently?
5. Verify the Newton factorization for a primitive root. Check the rank-three displacement formulas, convolution DAG fan-out, and arbitrary-content replay.
6. Check the measured workspace choice and the fixed kernel word for each shear, including a zero shear coefficient.
7. Reconstruct sector starts for nonconsecutive coordinate pairs. Explain why synchronization does not require borrowed coordinates to stay untouched by other axes.
8. Check the initial-prime working length, CRT permutations, chirp padding, the charged fixed-kernel transform, master root order, and final logarithmic exponent.
9. Assess Appendix A separately: local certificate, rational algebra extraction, explicit circuit printer and uniformization. Which of these does the main exponent need?
10. Compare with the precise hypotheses of prior FFT lower bounds. Record correctness, novelty and practical implications separately.

Overall assessment:

Exact invalid step, if any:

Unverified obligations:

External results checked (theorem and hypotheses):

Assessor and date: