mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-31 03:05:21 +00:00
0c9efac330
Squash the four overlapping feature branches into a single change set against main, eliminating cross-PR merge conflicts and the duplicated CI-fix scripts. What this brings in (merge order #79 -> #80 -> #81 -> #89): - #79 refactor(infra): shared utilities (4-Infrastructure/lib/*: q16, hashing, jsonl, fraction_utils) + the scripts/math-first/* validators that the math-check CI requires. - #80 feat(lean): Semantics.E8Sidon (1025 lines) -- Eisenstein coefficient identity E4^2 = E8 and the Sidon framework. E4_sq_eq_E8_coeff is fully proved (all Fourier-coefficient extraction machine-checked); the single residual gap is pinned to E4_sq_eq_E8_qExpansion (Mathlib lacks the valence formula / dim M8 = 1). 4 sorries + 1 axiom (e8_additive_completeness), all TODO(lean-port). - #81 refactor(lean): Float-free FixedPoint core (integer-only sqrt/log2/expNeg). E8Sidon.lean kept at #80's final 1025-line version (the #81 intermediate 438-line copy was overridden by merge order). - #89 feat(lean): Semantics.RRC.PolyFactorIdentity -- short-sleeve polynomial detection at the zerocopy limb boundary; now imports Semantics.E8Sidon for sigma3/sigma7/convolutionLHS (single source of truth) instead of inlining them. Conflict resolution: - flake.nix -> canonical rs-surface removal (Garnix shutdown). - scripts/math-first/* -> byte-identical across branches, clean. - .cursorrules / AGENTS.md -> unified; baselines + sorry inventory refreshed. Verification: - lake build (default aggregator): 3573 jobs, 0 errors. - lake build Semantics.RRC.PolyFactorIdentity (E8Sidon + FixedPoint + PolyFactor): 3655 jobs, 0 errors. Witnesses verified (sigma7 4 = 16513, convolutionLHS 6 = 2350). - Python tests: 68/68 pass. Note: the "Workers Builds: researchstack" check is a preexisting external Cloudflare build unrelated to this change (no branch touches 4-Infrastructure/cloudflare/). Build: 3573 jobs (default), 3655 jobs (narrow), 0 errors Co-Authored-By: Allaun Silverfox <bigdataiscoming+9i37y6j2@protonmail.com>
29 lines
947 B
Python
29 lines
947 B
Python
import math
|
|
import sys
|
|
from pathlib import Path
|
|
|
|
sys.path.insert(0, str(Path(__file__).resolve().parents[3] / "4-Infrastructure"))
|
|
from lib.q16 import to_q16
|
|
|
|
def generate_mem_files():
|
|
# 256 entries, x = index / 16.0 (if we use ray_t[19:12] as addr)
|
|
# However, to avoid 1/0, we'll use x = max(0.0625, index / 16.0)
|
|
|
|
with open("0-Core-Formalism/core/hw/diat_inv_table.mem", "w") as f_inv, \
|
|
open("0-Core-Formalism/core/hw/diat_sqrt_table.mem", "w") as f_sqrt:
|
|
|
|
for i in range(256):
|
|
x = i / 16.0
|
|
if x == 0:
|
|
x = 1/16.0 # Smallest non-zero
|
|
|
|
y_inv = 1.0 / math.sqrt(x)
|
|
y_sqrt = math.sqrt(x)
|
|
|
|
f_inv.write(f"{to_q16(y_inv):08x}\n")
|
|
f_sqrt.write(f"{to_q16(y_sqrt):08x}\n")
|
|
|
|
print("Success: Generated diat_inv_table.mem and diat_sqrt_table.mem")
|
|
|
|
if __name__ == "__main__":
|
|
generate_mem_files()
|