Research records · 14 September 2026
A question, a counterexample, a failed candidate and a restricted repair. Read the arguments and follow their recorded development without erasing the earlier attempts.
This is one operator’s AI-assisted research collection, offered for scrutiny. A stored digest can bind a version of the work; it does not establish scientific validity or independent review.
Case 2026-001 · mathematics · fixed-point methods
The case examines selected steps in Hammad, Dafaalla and Abdalla’s 2025 paper, Creating a novel algorithm for studying the strong convergence to a sequence with applications (source DOI). The source authors are not authors or endorsers of this review.
01 · Scoped audit
Exact witnesses separate nonexpansiveness, the projected target and origin damping. The iteration counterexample uses an explicitly stated interpretation of ambiguous printed notation.
Read the initial report →02 · Coordinate follow-up
A convex update removes the coordinate-origin discrepancy. A further counterexample shows that it can still select the wrong fixed point without added restrictions.
Read the translation note →03 · Restricted repair
A proposed replacement theorem gives explicit assumptions, a residual argument and a strong-convergence proof. Exact finite fixtures corroborate parts of the construction; they do not prove the general theorem.
Read the restricted theorem →These are internally checked drafts awaiting outside review. The later result does not validate the original article, establish novelty, or turn a publisher’s editorial concern into evidence of a mathematical error or misconduct.
A fixed historical prefix · 81 entries
The original export retains 34 contributions, 33 relationship assertions, seven concerns and seven assessments. It includes the initial public literature screening alongside the mathematical case. It is a snapshot of this collection, not a live feed or an exhaustive account of the field.
journal.json.The reader validates the complete export locally before displaying it. It does not upload the file, follow evidence links automatically, or verify a chain receipt. This download page works with JavaScript off; interactive replay needs JavaScript in the reader.
Entries 4–13 and 15–16 retain initial lookup and notice context for two other papers and Random Forests / Support-vector networks controls. They are not additional mathematical audits. Notice scope, lookup limits and author disagreement remain recorded. Earlier plans retain what was known and what had not yet been done at those stages.
The evidence index distinguishes exact included files, external publisher references and a sanitized internal receipt whose original contained private paths. Original evidence hashes are not silently replaced. No source-paper PDFs, private correspondence, keys or outreach drafts are distributed.
Byte commitments and their limits
On , a signed transaction on zerone-dev-1 recorded the journal commitment. Local cryptographic checks passed for the transaction signature, inclusion and execution result using the retained block evidence, including the following signed header.
Transaction 8DFC740C5326E76B482B6D370F527311CB518934D6B64A4BF5EFDBD2806D0B8E
1 uzrn self-transfer · fee 2,000,000 uzrn · 501 signed bytes · gas used 100,584. Development funds have no promised value.
Verification commands and trust limits · Download the chain proof packet · Recorded verification result
The memo directly binds the exact journal; its records carry evidence references. The separate archive manifests describe the downloadable files. The journal and proof files remain external and must stay retrievable. This is development-ledger storage under one disclosed consensus operator, not a native scientific Fact, proof acceptance, independent review or first-invention timestamp. It preserves this version without claiming that later entries do not exist.
ce6e799a-6713-41a9-b95f-57c50a22307423baf5b0a2e7f4a48fe2b86775ae2ef92e607f2d793270ff10219e61d256384786c8163599c0098aa43b4f3599a81b02a03557553fc595b67b026fdfe108704e9912727d3ccd88ee25e7b16eaa4ee6190b37d99b43ac280a1f60c658984b57c8dd80f7ca6ba15682301ee8d80c447d24eee79d80465a72f825572541ecad5995File manifest · SHA256SUMS · Chain proof manifest · Full reproduction instructions
Extract the archive into a fresh directory. It has no enclosing folder. With Python 3.10+, inspect the checker and run:
python3 -I -B packets/v0.1/verify_packet.py --manifest-sha256 14be4add8859e63633a5ff50ff82bcd98f43ba5fac66645e3f5d5d0f294b41db
python3 -I -B packets/v0.1/verify_exact.pyThe second command prints JSON to compare with packets/v0.1/exact-result.json. The README also gives commands for the translation and restricted-repair checks. No network or third-party dependency is needed for the exact checks. A matching computation is finite corroboration; review the analytic proofs and their assumptions separately.
Keep the shared past · add your own response
Retain the journal and evidence, verify the saved checkpoint, then start a local continuation with the fork and comparison tools. Every inherited entry keeps its original hash and declared attribution. Add a scoped review, concern or assessment using fresh record IDs.
Two reviewers can preserve the same earlier work and reach different assessments. The journal reader can compare their complete exports, showing their shared prefix and where they diverge. It does not choose a winner or merge their judgments.
Forking requires Python 3.10+ on macOS/Linux. Full chain-proof verification also requires the source and its pinned Go toolchain; the archives contain evidence, not an installed verifier. Local fork and comparison commands neither sign nor submit records. The bank checkpoint supplies no native Claim or Fact ID for a timed scientific review.