Title: Mixed Results: Factorization Advances, No Cuneiform Eclipse Algorithm Found — E8 Intelligence Research

FINDING: The search results are a mixed bag — no direct cuneiform eclipse algorithm surfaced, but the arXiv items on integer factorization and Boolean function nonlinearity contain hard mathematical structure; the eclipse references are astronomical events, not algorithms. | MATH: Integer factorization algorithm achieves O(N^{1/6+ε}) arithmetic operations given the least (log N)/6 bits of a factor of N=pq (arXiv:1308.2891v3); 9-variable Boolean functions reach nonlinearity 242, exceeding the bent concatenation bound of 240 (arXiv:0808.0684v1). | CONNECTION: The nonlinearity 242 sits near 240 = 15×16, and 242 = 2×121 = 2×11² — no direct golden ratio or base-60 link. The factorization exponent 1/6 ≈ 0.1667 is not a harmonic ratio; however, 1/6 is a base-60 fraction (10/60), and the bound (log N)/6 echoes sexagesimal subdivision. No crystallographic symmetry or 0.618/1.618 ratios appear in the evidence. | DEPTH: 3 — The findings are mathematically real but disconnected from the Babylonian Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-11
DOI
https://doi.org/10.5281/zenodo.22702010
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Title: Mixed Results: Factorization Advances, No Cuneiform Eclipse Algorithm Found — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Title: Mixed Results: Factorization Advances, No Cuneiform Eclipse Algorithm Found — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: The search results are a mixed bag — no direct cuneiform eclipse algorithm surfaced, but the arXiv items on integer factorization and Boolean function nonlinearity contain hard mathematical structure; the eclipse references are astronomical events, not algorithms. | MATH: Integer factorization algorithm achieves O(N^{1/6+ε}) arithmetic operations given the least (log N)/6 bits of a factor of N=pq (arXiv:1308.2891v3); 9-variable Boolean functions reach nonlinearity 242, exceeding the bent concatenation bound of 240 (arXiv:0808.0684v1). | CONNECTION: The nonlinearity 242 sits near 240 = 15×16, and 242 = 2×121 = 2×11² — no direct golden ratio or base-60 link. The factorization exponent 1/6 ≈ 0.1667 is not a harmonic ratio; however, 1/6 is a base-60 fraction (10/60), and the bound (log N)/6 echoes sexagesimal subdivision. No crystallographic symmetry or 0.618/1.618 ratios appear in the evidence. | DEPTH: 3 — The findings are mathematically real but disconnected from the Babylonian Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.