ESPAÑOLSupport the Lab
GRAMMAR-01REJECTED

Closed search under a frozen grammar

A closed search evaluated 120,259,084,288 hashes under a preregistered candidate grammar. No candidate survived and no useful signal was found. Publishing the closure prevents the same hypothesis from being rediscovered without new evidence.

Published
2026-08-14
Updated
2026-08-14
Authors
BTC PoW Lab
Replication
Closed under the registered grammar
Mining advantage claimNO MINING ADVANTAGE

Local structure, statistical signal and operational advantage are evaluated separately.

Question

Does the frozen relation grammar produce a useful surviving candidate or registered signal?

Hypothesis

At least one grammar member may survive the confirmatory search.

Why this matters

A large negative result narrows the search space and records where not to spend more compute.

Method

Freeze the grammar and acceptance criteria before running the exhaustive registered campaign.

Experimental setup

Baseline
Null survival under the frozen acceptance rule.
Setup
Closed campaign with immutable grammar and audit counters.
Hardware
Classical high-throughput hashing infrastructure.
Dataset
Campaign audit totaling 120,259,084,288 hashes.

Results

Hashes tested120.26B
Survivors0
StatusCLOSED
  • 120,259,084,288 hashes evaluated.
  • No candidate survived.
  • No useful signal under the frozen grammar.
ANALYSIS / MODEL

Scientific analysis

GRAMMAR-01 is a closed negative search. Candidate syntax, admissible transformations, acceptance rule and accounting were frozen before the high-throughput campaign, preventing the search from expanding after failures were observed.

The campaign evaluated 120,259,084,288 hashes and recorded zero survivors under the frozen gate. The correct conclusion is scoped: no member of this registered grammar survived. It is not a theorem about every possible relation grammar.

A closed null result has scientific value because it constrains future work. Reopening requires a materially new, preregistered mechanism—not relabeling the same candidate family after inspecting its failure.

Funnel from a frozen grammar through 120 billion evaluations to zero survivorsThe frozen grammar emitted a fixed candidate space. After 120.259 billion audited hashes, the acceptance gate recorded zero survivors; the closure applies only to that grammar.CLOSED REGISTERED SEARCHFROZEN GRAMMAR120,259,084,288 HASHES0 SURVIVORS
Closed registered search
Frozen grammar↓120,259,084,288 hashes↓0 survivors
FIG / EVIDENCEThe frozen grammar emitted a fixed candidate space. After 120.259 billion audited hashes, the acceptance gate recorded zero survivors; the closure applies only to that grammar.
ANALYSIS / EQUATIONS

Mathematical formulation

N = 120,259,084,288; k = 0 survivors

The primary result is an audited exhaustive campaign count under the registered grammar.

P(K=0 | p,N) = (1 − p)ᴺ

Under an independent Bernoulli approximation, this is the probability of observing no survivors.

p₉₅ < 1 − 0.05^(1/N) ≈ 2.49×10⁻¹¹

This one-sided bound is illustrative only; dependence or grammar structure can invalidate the Bernoulli assumption.

ANALYSIS / STATISTICS

Statistical reading

Zero is a result, not a missing measurement. Both the numerator and the full denominator are reported.

The approximate 'rule of three' bound is useful for scale but is not promoted as an exact cryptographic theorem.

Optional stopping and grammar mutation were excluded by freezing the campaign before execution.

ANALYSIS / SCOPE

Validity and scope

  • Strong internal accounting for the registered campaign.
  • Conclusion does not generalize beyond the frozen grammar and gate.
  • No claim is made that SHA-256 has no exploitable structure; only this search family closed.
SOURCES / METHOD

Methodological references

  1. NIST FIPS 180-4 — Secure Hash Standard
  2. Nakamoto — Bitcoin: A Peer-to-Peer Electronic Cash System

Interpretation

The registered hypothesis did not survive. The result is closed, negative knowledge—not evidence that all possible grammars fail.

Limitations

  • The closure applies only to the frozen grammar and gate.
  • A materially different preregistered hypothesis is outside this result.

Reproduction

Use the identical grammar, hash accounting and survival gate; report all attempted candidates, including zero survivors.

Artifacts

Redacted closure report under publication review.

Research-use notice

Experimental content is provided for research and educational use, without warranty. Validate independently before relying on it. Read the full disclaimer.