Honest Disclosure

Research Limits

We study hard mathematics - factoring, discrete logs, the Bitcoin puzzle addresses - as exploratory research and benchmark fixtures. We have not broken any of them, and this page exists so no one mistakes our curiosity for a breakthrough. It states our no-solve doctrine in plain words and gives you an instrument that flags overclaiming language on sight.

God's Math QCE MathBench

The simple believeth every word: but the prudent man looketh well to his going. — Proverbs 14:15

The No-Solve Doctrine

We do NOT claim to have solved Bitcoin puzzle 71 (BTC71), BTC135, RSA, the elliptic-curve discrete logarithm problem (ECDLP), or any hard semiprime. Our work on these surfaces is rigorous exploratory research and self-policing honesty hygiene - not a cryptanalytic breakthrough.

Constant-factor speedups are constant-factor speedups. Techniques such as mod-30 CRT and coprimality filtering, or faster bare-metal runs, may prune work or improve input/output and runtime. They do NOT change a complexity class, collapse an exponent, break RSA, or solve a Bitcoin key. "Minutes on bare metal" is never, by itself, a proof of cryptanalytic truth.

Semiprime factoring and ECDLP are different surfaces. Factoring a semiprime is not the same problem as an elliptic-curve discrete log, and there is no free transfer between them. BTC71 in particular exposes no public key, so nothing here may be read as a direct ECDLP attack on that address. Exposed-public-key discussions (such as BTC135) stay separated and still cannot be called solved.

The Wording Guardrail

Blocked vocabulary

These phrases are forbidden on this surface unless a future explicit proof authority replaces the guard:

solved btc71 btc71 solved btc135 solved rsa broken broke rsa 1000d factored semiprime-to-ecdlp semiprime to ecdlp ecdlp solved cryptanalytic breakthrough minutes on bare metal public quantum advantage public cryptanalytic advantage physical qubits dense trillion-qubit simulation hard semiprime factored 1000d factorization proof benchmark proves solver davar body proves public claim ready private key recovered cracked the key

This instrument is the public face of the WO32251 btc71_semiprime_wording_guard lane. Paste a sentence about our hard-math work and it scans for blocked overclaiming phrases. ALLOWED does not mean a claim is true - it only means the sentence avoids the forbidden vocabulary. The authority for what is real remains the receipts and the no-solve doctrine above, not this checker.

Why We Publish This

Hard-math research attracts overstatement, and overstatement would embarrass the ministry and mislead people. So we wrote the boundary down and made it public. Allowed wording for this surface is no-solve doctrine, constant-factor guardrails, route and slice selection language, exact-replay fixture language, missing-root repair needs, and blocked-claim vocabulary. Blocked wording includes "solved BTC71", "RSA broken", "1000d factored", "semiprime-to-ECDLP", "ECDLP solved", "cryptanalytic breakthrough", "minutes on bare metal" as proof, "public quantum advantage", "physical qubits", and "dense trillion-qubit simulation".

The checker below runs server-side in plain C and simply matches your sentence against that blocked list. It is a mirror, not a judge: it keeps our own language honest and invites you to hold us to the same standard. No client JavaScript runs in your browser.

Go Deeper

Our math is meant to teach and to stay honest, not to dazzle:

God's Math - a Scripture-first math studio.

QCE MathBench - a transparent benchmark instrument.

The Balances - weigh two passages by shared wording.

The Scriptorium - native study engines.

↑