back to table · edit · history · where entries came from · files · download
2374 bytes, as of the version from 2026-10-27 01:02 (current). Recorded here, not run.
{
"tid": "T191",
"before_count": 23,
"after_count": 37,
"baseline_revision": "4662bdca35fd07ea6d4aad67a83a39e0cf710e7b97bbe84ffcce17baffcdfbb7",
"baseline_stale": false,
"selection": {
"complete_note": "it preserves $\\operatorname{li}(2)$ and the published $10^n$ benchmarks for $1\\leq n\\leq22$, and adds primes $3\\leq p\\leq23$ and $e^m$ for $m=-2,-1,1,2,3,4$ as exploratory structural references on both sides of the singularity at $1$",
"comment": "The existing decimal powers remain the explicit prime-counting benchmarks of CITE{PrimeCountingBenchmarks}, not a new decimal mesh. The first nine primes, including the retained argument $2$, provide a bounded reference at the first jumps of prime counting; this is our exploratory selection, not a claim that the source tabulates those inputs. The exact substitution $\\operatorname{li}(e^m)=\\operatorname{Ei}(m)$ selects short exponential arguments on both sides of $1$ and distinguishes the unoffset convention CITE{DLMFIntegralDefinitions}. The exponent list is a finite reference choice, not a completeness claim.",
"sources": [
"https://dlmf.nist.gov/6.2",
"https://sweet.ua.pt/tos/bib/5.4.pdf"
],
"families": [
"preserved documented prime-counting benchmarks",
"first prime-counting jump locations",
"exponential substitutions across the logarithmic singularity"
]
},
"policy_sha256": "e37efb7e2ededf6c1d7134c673f152f648f26e0267c556aebdf3ec65765d8b4c",
"sources_preserved": {
"checks-evidence.json": "c09511e6027db13cd070a35a220e024ee4ed8f22f6d12aac7b6b1c39a2bbb91d",
"checks.py": "9fb1a41c4b191886094af842cc3c2c7d1cd9839fba1822ebc3c3d6475d04cc6b",
"generate.py": "9aa3b7c710a0705beceb40e2c75d167c11c3d3a6b142512332953ea4a6424815",
"relevance-audit.json": "1be44027ef7f7968d1782b499629f0c9faf486fc4fcb25b7b17752403005cb64",
"remaining_values.py": "5c383e4617511b0b97447d9e9eda57c6a046481a763d2c5e7e4222bb7c860d8c",
"republish.py": "20d5d23f80895adc6629e61126d165364199b100a5956d234b152de8e34af0b3"
},
"new_generator_provenance": "Extends the attached certified elementary/delay approach; all retained strings remain unchanged and are recomputed, new values are separately checked.",
"removed_entries": [],
"assistance": "codex-cli selected families, implemented generator and performed numerical checks"
}