Anna Matrix
Companion
Re-check, September 2026. The matrix is a table our team compiled by hand from replies of the Anna bot on X. This notice covers every section of the companion and the PDF. Only the point symmetry (§1) holds as stated. The period-4 result (§3) is a hypothesis: only 768 sampled inputs were verified and global convergence is unproven. The seven-position asymmetry (§4) depends on a run of cells in column 30 that is very likely an entry error in the typed table, and the Genesis block script reading (§6) was not confirmed. The diagonal and Patoshi reading (§5), the embedded messages (§7), the on-chain triangle (§8) and the 1CFB anchors (§9) were not confirmed and stay open. The Tier labels in the PDF are out of date. No bridge or activation was found. See the September 2026 re-check.
This companion is designed to be loaded into a large language model, Claude, GPT, Grok, Gemini, alongside Chapter 13 of Qubic, The Long Version. The chapter tells the story of how the Anna Matrix was found. This document carries the arguments. Several of them were not confirmed in September 2026 and stay open (see the notice above).
Large language models do not have statistical intuition. They complete patterns. When asked about a puzzle without forensic context, they hallucinate beautiful answers. This document exists so that an LLM reading it can distinguish a real finding from its own invention.
If you are a human reader without an LLM: every claim still includes a verification method. You can run the four-line scripts yourself. You do not need to take anything on faith. That is the point.
Three Confidence Tiers
These are the labels the PDF uses. They are out of date: most sections the PDF marks as Tier 1 were not confirmed in September 2026 and stay open. The badges in the contents list below show the current status.
Reproducible by anyone with a calculator or four lines of Python. Verifiable on public data. ~99% confidence.
Multiple independent indicators point to the same conclusion. Documented patterns. 50–89% confidence.
Hypothesis only. Consistent with evidence but not proven. 10–49% confidence. Marked clearly as speculation.
Honest Accounting
The PDF reports 22,480 hypotheses tested and 10 confirmed at Tier 1. An independent review in September 2026 did not uphold those labels: only the point symmetry (§1) holds as stated, the period-4 result (§3) is a hypothesis, and §4 to §9 were not confirmed and stay open.
Verify It Yourself
Two claims you can run yourself on any machine with NumPy. The first holds as stated; the second only covers the inputs you sample. The matrix data lives at qubic.church/data/anna_matrix.json.
import numpy as np
import urllib.request, json
# Load the published Anna Matrix
url = "https://qubic.church/data/anna_matrix.json"
M = np.array(json.loads(urllib.request.urlopen(url).read()))
assert M.shape == (128, 128)
matches = sum(1 for i in range(128) for j in range(128)
if M[i][j] + M[127-i][127-j] == -1)
print(f"Symmetric cells: {matches} / 16384")
print(f"Symmetry ratio: {matches/16384*100:.2f}%")
# Expected: Symmetric cells: 16316 / 16384 | Symmetry ratio: 99.58%Iteratingsign(M·v)reached a period-4 cycle on the 768 sampled inputs that were verified. That does not prove every input converges, and some inputs need 22 steps.
import numpy as np
import urllib.request, json
url = "https://qubic.church/data/anna_matrix.json"
M = np.array(json.loads(urllib.request.urlopen(url).read()))
def step(v):
return np.sign(M @ v).astype(int)
def find_cycle(v_start, max_steps=200):
history = [tuple(v_start)]
v = v_start
for _ in range(max_steps):
v = step(v)
if tuple(v) in history:
cycle_start = history.index(tuple(v))
return len(history) - cycle_start, len(history)
history.append(tuple(v))
return None, max_steps
np.random.seed(42)
periods = []
for _ in range(1000):
v0 = np.random.choice([-1, 1], size=128)
period, steps = find_cycle(v0)
periods.append(period)
print(f"Distinct periods: {set(periods)}")
print(f"All converge to period 4: {all(p == 4 for p in periods)}")
# Expected: Distinct periods: {4} | All converge to period 4: TrueContents · 13 Sections
99.58% of all 16,384 cells satisfy M[i][j] + M[127−i][127−j] = −1.
Bonferroni correction across ~22,480 tests; Monte Carlo null tests; what we deliberately do not do.
Iterating sign(M·v) reached a period-4 cycle on the 768 sampled inputs that were verified. Global convergence is unproven, and there are at least two cycles.
Antipodal identity holds for 121 of 128 cycle positions; breaks at exactly [3, 18, 32, 61, 65, 101, 109]. Invariant across five independent encodings of the Genesis Block public key.
10 main-diagonal cells with |value| = 27 at heights [72, 73, 74, 79, 88, 92, 94, 95, 119, 120]; the claim was that every one is a Patoshi-mined Bitcoin block from January 2009 with 50 BTC reward, never spent.
Genesis 65-byte public key parses as four valid Script opcodes including PUSHBYTES_72 (0x48 = 72). M[72][72] = −27.
"CFB" appears at row 11 in the XOR-127 stream (Population B of attractor, mirror at row 116 preserved). GAME, MEGA, KEY, SATOSHI, YOU, ARE, ALL: all debunked.
Three Qubic addresses issued tokens with supplies 676×10⁹, 676, 1. HASV→PXMARAS sent 26 QU exactly 27 times. AIGARTH issued 6,268 days after Bitcoin Genesis. All on-chain.
Vanity-address byte alignments to the matrix and to PUSHBYTES_72.
Who created the matrix is treated as Tier 3 with explicit marking. No cryptographic signature settles it. We do not pretend otherwise.
What the re-check did not confirm, including some claims earlier versions of this research treated as confirmed.
Python snippets, longer scripts at /docs/05-appendices/03-scripts, Monte Carlo runs in 2-5 minutes on a laptop.
Patoshi (Lerner 2013), CfB, sign() ternary clamp, M[i][j] notation.
Only §1 holds as stated. §3 is a hypothesis, and §4 to §9 were not confirmed in September 2026 and stay open.
What This Document Will Not Do
- Claim identity. Who created the Anna Matrix is treated in §10 with explicit Tier 3 marking. No cryptographic signature has been provided that would settle it. We do not pretend otherwise.
- Combine p-values across dependent tests. Multiple structural findings about the same matrix are not independent. We report each individually.
- Hide unconfirmed hypotheses. Section §11 lists what the re-check did not confirm, including some claims that earlier versions of this research treated as confirmed.
Download the Full Companion
The full PDF contains all 13 sections, all Python verification snippets, all tables of Bitcoin block heights, encoding-invariance proofs, and the complete table of negative results. 41 pages. Designed to be loaded into Claude, GPT, Grok or Gemini alongside Chapter 13.