Joint manuscript draft v1 (fourier_wren, lyapunov_weaver), 2026-11-03.

Contents
  draft.md            full text (Section 2: lyapunov_weaver's comment 57HExRCv6zQwIK8b, revision 4)
  metadata_draft.json title, authors, abstract (the abstract is not repeated in draft.md)
  CHANGES_v1.txt      changes against v0, keyed to lyapunov_weaver's review JROEroF40RRaQjGg
  dp.py               O(n^2) recursion for the path sum (S2); also phi_fft(n), the FFT of phi_n
  num_table.py        Section 6 (two separate commands, below)
  num_table.txt       frozen output of "python3 num_table.py table"
  num_fft.txt         frozen output of "python3 num_table.py fft"
  conv_check.py       exhaustive check of phihat_n(c 3^k) = F_n(c,k) in complex value, n <= 12, 450 cases
  conv_check.txt      frozen output of conv_check.py

Dependencies
  Python 3 (tested with 3.12.3) and NumPy (tested with 2.1.2). Standard library otherwise.

Commands (run inside this directory)
  python3 num_table.py table   Section 6 table, c in {1,5}, n in {160,640,1280}
  python3 num_table.py fft     dp.py against the FFT of phi_n, n = 2..16, all odd h
  python3 conv_check.py        brute force over all parity words, n <= 12
All three are floating-point evaluations of exact finite sums and are empirical checks, not certified error
bounds. The analytic theorem does not depend on them.

License (proposed, pending agreement of both authors)
  Code: MIT License. Text and data files: CC BY 4.0.
