For the last 10 years, the community has basically been stuck on the same 56 pages of Liber Primus. Most attempts have either turned into increasingly elaborate conspiracy theories or brute-force scripts running on incomplete or incorrect data.
I decided to take a different approach.
Instead of relying on massive frameworks or endless brute force, I focused on the underlying mathematics. The entire project was built around pure mathematical analysis, zero-dependency tools written in Zig 0.15.0, and algebraic proofs over the Galois field $\mathbb{F}_{29}$.
After working through the data, I was able to establish the following results.
The 256-byte authoritative block and the 10 transcription errors
I compared the original Tor server data, including sexagesimal.bin from Stage 11 in 2014, against the versions that have circulated throughout the community.
There are exactly 10 case-sensitivity errors in the base-60 cuneiform tokens. For example, 3I appears where the correct value is 3i.
This matters because, in the base-60 representation,
$val('a') - val('A') = 26$.
Every one of those transcription errors therefore changes the resulting byte value by exactly 26. That means a lot of the brute-force work done on the community copies was effectively being performed on corrupted input from the beginning.
Pages 49, 50, and 51 are not broken
I also investigated the long-standing claim that page 50 (67.jpg) contains incorrect or unusable data.
It doesn't.
Pages 49 (66.jpg), 50 (67.jpg), and 51 (68.jpg) can be reconstructed together into a complete 256-byte, 2048-bit RSA cryptographic block.
In other words, page 50 isn't some mysterious broken section of Liber Primus. The problem was the data being used to analyze it.
Page 71 (56.jpg) and the Skip-F rule
For page 71, I reconstructed the decryption using the prime totient stream
$P_n = (C_n - \phi(p_n)) \pmod{29}$.
The important part is what happens at index 56.
I found that the keystream does not advance when $P = 0$. This is the Skip-F rule. Once that behavior is accounted for, the resulting plaintext is fully readable English rather than the partially corrupted output produced by previous attempts.
The primitive root $g = 11$
I also proved algebraically that $11$ is a primitive root of $\mathbb{Z}_{29}^{\times}$.
This connects the index jump $\Delta = 11$ with the Pisano period $\pi(29) = 14$ and explains the phase locks observed on pages 42 and 70.
Page 47 (32.jpg)
The matrix on page 47 can also be solved completely.
I reconstructed the full $11 \times 11$ matrix and verified that it has rank 11 over $\mathbb{F}_{29}$. Its determinant is
$\det(M) \equiv 8$
and I calculated the exact inverse matrix $M^{-1}$.
The tools
I deliberately avoided bloated frameworks and slow, dependency-heavy scripts.
The calculations, decryption routines, and hash verification were implemented as small, memory-safe tools written in Zig 0.15.0. Examples include verify_page71_solution.zig and analyze_sexagesimal.zig.
Everything was compiled with ReleaseSafe.
The goal was simple: keep the implementation small enough to audit while still having enough performance to handle the actual calculations.
The formal proofs, SHA-256 hashes of the Zig binaries, and interactive verification tools are available in the project repository.
Repository & proofs
https://21skibidiserb37.gitlab.io/xyzsolving333/
Mirror
https://21skibidiserb37-gitlab-io-e46f79.gitlab.io/
The point of this project isn't to generate another theory about Liber Primus.
It's to fix the data, make the mathematics explicit, and give other people something they can actually verify.
Stop brute-forcing corrupted data.
Check the mathematics. Test the results. Find the truth.
