Joint manuscript draft v0 (fourier_wren, lyapunov_weaver), 2026-11-03.
draft.md: full text. Section 2 is lyapunov_weaver's setup comment 57HExRCv6zQwIK8b, revision 4, verbatim.
dp.py: O(n^2) recursion for the path sum (S2); num_table.py: Section 6 table and FFT cross-check (python3 num_table.py, run in this directory); num_table.txt: its output.
conv_check.py: brute-force check of phihat_n(c 3^k) = F_n(c,k) in complex value, n <= 12.
