mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-08-13 23:20:35 +00:00
b5319c7d98
Applies the integer-to-polynomial decomposition technique (Trail of Bits, 'short-sleeve' RSA factoring, 2026) as a classification feature for the Rainbow Raccoon Compiler identity step. Architecture: - limbDecompose: convert integers to base-B polynomial coefficients (models the zerocopy boundary where raw limbs are already exposed) - shortSleeveDetected: cheap sparsity check flags structured integers - polySignature: full structural features when flagged (degree, GCD, energy, sparsity, term count) - polyDecomposabilityScore: Q16_16 score for RRC feature integration - zeroCopyScan: batch scanner for hardware DMA boundaries - E8Sidon integration: sigma3/sigma7/convolution polynomial signatures 3 sorries (all with TODO(lean-port) + proof sketches): - limbDecompose_polyEval_roundtrip (base-B representation theorem) - zeroLimbs_bound_terms (filter complement partition) - shortSleeve_mono_zero_prepend (sparsity monotonicity) Build: passes (Semantics.RRC.PolyFactorIdentity target, 0 errors) Co-Authored-By: Allaun Silverfox <bigdataiscoming+9i37y6j2@protonmail.com> |
||
|---|---|---|
| .. | ||
| conversions/hardware | ||
| external/OTOM | ||
| LeanGPT | ||
| Semantics | ||
| CHAIN_ALL_REVIEW_REPORT.md | ||