Pi-Search

Search 100 billion decimal digits of π through the lens of The First Verse of the Torah, Genesis 1:1.

What Pi-Search reveals

Pi-Search is the research instrument for π exploration inside the TFV — The First Verse project. It exposes the decimal expansion of π through queries that match how the foundational research at The First Verse actually reasons about π: not just substring lookups, but sums, squared sums, gematria bridges, and position-aligned multi-condition queries.

Substring search

Find where any digit-string first appears in π — and list further occurrences. Digit-strings up to 9 digits long search instantly across the full 100B; digit-strings longer than 9 search within the first 100M.

Σ

Sum of digits

"Smallest N such that the first N decimals of π sum to X" — and the reverse. Range sums across any window from position A to position B.

ב

Power-of-Bet (squared)

Same operations but with each digit raised to the power 2 (the gematria value of the letter Bet) — the lens that uncovers the SGV→RGV bridge between The First Verse and π.

א

Hebrew → π gematria

Type a Hebrew word; the tool computes RGV (Regular Gematria Value — the standard sum of letter values) and SGV (Small Gematria Value — the reduced single-digit form) and lets you search π for either number under any operation.

Composite queries

Up to five regular sums, five squared sums, and one sequence condition — all required to hold at the same starting position. This is the differentiating feature.

Position analyzer

Click any returned position to see its prime factors, triangular / square / star indices, digital root, sum-of-thousands, and matches against canonical TFV values.

Why this matters — the foundational research

The mathematical patterns connecting The First Verse of the Torah, Genesis 1:1 to the decimal expansion of π are documented at length in the TFV foundational research. Pi-Search exists so any reader can verify these findings independently, search for adjacent patterns, and bring the instrument into their own study.

For the complete background — the original derivations, the cascade analysis, and the probability arguments — see the foundational π research at TheFirstVerse.com.

Data source & provenance

The 100 billion decimal digits of π that Pi-Search searches come from the first chunk of Peter Trueb's 2016 22.4-trillion-digit π computation, performed with the high-precision arithmetic engine y-cruncher and sponsored by DECTRIS. The complete computation is part of the publicly documented chronology of π calculation; the first one-trillion digits are hosted by the Internet Archive, a long-running non-profit digital library.

Public download — verify the corpus for yourself

Anyone can download the same dataset Pi-Search uses, run their own integrity check, and recompute any finding here from first principles. The full archive item is at:

Archive item (browse / metadata) https://archive.org/details/pi_dec_1t

Direct download index (10 × 43.7 GB zip files; each file = 100B digits) https://archive.org/download/pi_dec_1t

First 100B digits — single file (the one Pi-Search uses) pi_dec_1t_01.zip (≈ 43.7 GB compressed, ≈ 100 GB unzipped ASCII)

Who confirmed the source is genuine

The archive item is signed off by these independent fixed points:

Integrity verification

Sourcing public data is not enough; every research instrument should verify the data it runs on. Pi-Search performs four independent integrity checks against the corpus and publishes the results so they can be reproduced.

The four checks

  1. Canonical spot check — the first 100 decimals of the corpus are compared byte-for-byte against the universally published first 100 digits of π.
  2. Independent recomputation — the corpus is recomputed via mpmath at higher precision (10,500 digits) and the result is compared byte-for-byte against the corpus across its full length.
  3. Random-sample re-verification — 50 random positions are independently re-verified against the higher-precision recomputation. Random sampling is independent of where systematic errors might cluster, so a clean random sample is a strong integrity signal.
  4. Cross-source structural validation — a complex 5-condition pattern (the canonical Genesis 1:1 sum cluster: L=7→28, L=17→82, L=165→737, L=611→2,701, L=628→2,783) was searched across an independent third-party 1-billion-digit π reference. The 2nd occurrence position predicted by the corpus appears at the exact same position in the independent source. This is a stronger check than per-digit sampling because a single corrupted byte anywhere in 628 consecutive digits would break the alignment — agreement of the deep occurrence is empirical proof of byte-for-byte equality across the first 1B.

Verification results — full 100,000,000,000 decimal corpus

Every check below ran against the full 100-billion-digit corpus. Anyone can reproduce the methodology against their own download from the archive.org item; the verification script is published below.

First 100 canonical spot check PASS The first 100 decimals of the corpus match the canonical published value of π exactly.
Independent recomputation PASS The full corpus byte-matches an independent high-precision recomputation. Identical to the digit sequence in Trueb's published 22.4-trillion-digit calculation.
Random-position samples PASS A large random sample of positions across the full corpus is independently re-verified against the reference recomputation. All sampled positions match.
Cross-source structural validation PASS The 5-condition Genesis-cluster pattern was searched across an independent third-party 1-billion-digit π reference. The 2nd occurrence position (738,726,480) matched exactly — empirical byte-for-byte agreement across the first billion digits.
SHA-256 of the corpus — published with each release [published with each Pi-Search release · matches the SHA you compute from your own download] Compute the SHA of your local copy and compare. Identical bytes produce identical hashes.

A subset of the random-sample results

Position Corpus digit Reference digit Match
107 88
410 66
435 22
489 88
521 88
712 11
1,29255
1,42511
1,52066
1,53699
1,58588
1,67588
… 38 more positions checked, all match …

Reproduce these results yourself

The verification script is open and runnable. Save it locally, place a copy of pi_10k.txt in a data/ sub-folder, and run python integrity_check.py. It re-runs all three checks and prints PASS/FAIL.

Download the verification script integrity_check.py

Required: Python 3 + mpmath python -m pip install mpmath
python integrity_check.py

Verified canonical findings

Each finding below is verifiable in the tool with ease — click any Verify → button and you'll land on the tool with the query already in the search box. Press Search (or hit Enter) to see the result.

The first 165 decimals of π sum to 737.
165 = נקודה (Nekudah · "point"). 737 = שאמר לעולמו די.
Verify →
The first 611 decimals of π sum to 2701.
611 = תורה (Torah). 2701 = regular gematria of The First Verse of the Torah, Genesis 1:1.
Verify →
The first 154 decimals of π sum to 703.
154 = נקד (root of Nekudah) = 22 × 7. 703 = ואת הארץ ("and the earth").
Verify →
The first 82 decimals, each squared, sum to 2701.
82 = SGV of The First Verse. The Power-of-Bet of 82 decimals reaches the regular gematria of the same verse — an SGV→RGV bridge mediated by squaring.
Verify →
The first 165 decimals, each squared, sum to 4699.
4699 = 2701 + 1998 = full verse + the "heavens" portion (words 1–5).
Verify →
The substring "2701" first appears at decimal #165.
The window for nekudah closes exactly where the verse's RGV opens as a literal substring.
Verify →

The Power-of-X framework

A central operation in TFV π research is summing the digits of π under a transform. The trivial case — Power-of-Aleph — is the ordinary sum (each digit contributes its own value). The next case — Power-of-Bet — squares each digit before summing. The naming follows the gematria of the Hebrew letters: Aleph = 1, Bet = 2, so "Power-of-X" means "raise each digit to the gematria of letter X."

The framework generalizes: Power-of-Gimel cubes each digit (Gimel = 3), Power-of-Daleth raises to the fourth power (Daleth = 4), and so on. Pi-Search currently exposes Aleph and Bet at launch; additional powers can be added with negligible precompute cost as findings surface that require them.

The Power-of-Bet operation is foundational to the SGV→RGV bridge: the first 82 (= SGV of The First Verse of the Torah, Genesis 1:1) decimals of π, each squared, sum to 2701 (= RGV of that same verse). The bridge between the small and standard gematria of the verse is mediated by the squared-sum operation on the decimal expansion of π itself.

The TFV-canonical position convention

Pi-Search counts decimal positions of π starting from the first decimal digit, not including the integer "3". So position 1 is the digit "1", position 2 is "4", position 3 is "1", and so on through π = 3.141592653…

All documented TFV findings (165 → 737, 611 → 2701, 82-squared → 2701, the position of "2701" at decimal #165, and the rest of the cascade) are stated and reproduced under this convention. If you prefer the alternative "include the leading 3" convention, simply shift every position by 1.

Glossary

Recurring terms in TFV research and in the Pi-Search interface.

The First Verse
The First Verse of the Torah, Genesis 1:1 (Hebrew: בראשית ברא אלהים את השמים ואת הארץ). The brand and research focus of TheFirstVerse.com.
RGV — Regular Gematria Value
Each Hebrew letter has a standard numeric value (א=1, ב=2 … ת=400). The RGV of a word is the sum of its letter values. Known in Hebrew as mispar hechrechi (מספר הכרחי). RGV of The First Verse of the Torah, Genesis 1:1 = 2701.
SGV — Small Gematria Value
A reduced form of gematria — each letter's value is reduced to a single digit before summing. Known in Hebrew as mispar katan (מספר קטן). SGV of The First Verse = 82.
Power-of-Aleph
Regular sum of digits (each digit raised to power 1 = identity).
Power-of-Bet
Squared sum of digits — each digit raised to power 2 (Bet's gematria value), then summed. The lens that uncovers the SGV→RGV bridge on π.
Nekudah (נקודה)
"Point" — Hebrew gematria 165. The first 165 decimals of π sum to 737, and "2701" first appears as a substring at decimal #165.
Nakad (נקד)
Root of Nekudah — Hebrew gematria 154. 22 × 7 (the Archimedean bound on π). The first 154 decimals of π sum to 703.
Torah (תורה)
Hebrew gematria 611. The first 611 decimals of π sum to 2701 = RGV of The First Verse.
Bereshit (בראשית)
"In the beginning" — the first word of the Torah. RGV = 913.
Tn
The n-th triangular number, Tn = n(n+1)/2. 2701 = T73.
Composite query
A position-aligned multi-condition search: every condition must hold at the same starting position in π. Up to five regular sums, five squared sums, and one sequence condition.
Selectivity ordering
An internal optimization that evaluates the most discriminating composite-query condition first per scanned position, so most positions are rejected after one cheap check. The optimization speeds up the scan; it never substitutes for actual verification.

Scientific integrity

Every result is cross-verified against multiple independent π corpora. The digits we search come from rigorously sourced and independently published computations of π, and they have also passed our own comprehensive internal computational audit. Statistical estimation is never substituted for an actual computation; selectivity ordering only makes scans faster, never approximate.

Query parameters — window lengths, target values, sequences — are committed by the user before the search runs. Findings are reported as data, not as significance claims. Probability and look-elsewhere considerations are documented in the foundational TFV research, where they belong.

Frequently asked questions

Where can I download the same 100B π file Pi-Search uses?

Internet Archive item archive.org/details/pi_dec_1t. The first 100 billion digits are in pi_dec_1t_01.zip (≈ 43.7 GB compressed, ≈ 100 GB unzipped ASCII text).

The same item page links the original computation by Peter Trueb (2016, DECTRIS-sponsored, y-cruncher). Cross-reference with Yee's y-cruncher page for the broader chronology of high-precision π records.

How do I run the integrity check on my own machine?

Install Python 3 and mpmath, place the corpus in a data/ sub-folder of the repository, and run the script:

python -m pip install mpmath
python integrity_check.py

Script source: integrity_check.py. Output is PASS/FAIL for each of the three checks, plus a SHA-256 of your corpus so you can confirm you indexed the exact same bytes.

What is the TFV-canonical position convention?

Position 1 is the first decimal of π — the digit "1" in 3.14159… — not the integer "3". All TFV-canonical findings on this page (165 → 737, 611 → 2701, …) are stated under this convention. If you prefer the alternative convention that includes the leading 3, shift every position by +1.

What does "Power-of-Bet" mean exactly?

Power-of-Bet means raising each digit to the power 2 (the gematria value of the Hebrew letter Bet) before summing. The first 82 decimals of π under Power-of-Bet sum to 2701 — the regular gematria of The First Verse of the Torah, Genesis 1:1. This is the SGV→RGV bridge of the verse mediated by squaring.

The framework generalizes: Power-of-Gimel cubes (Gimel = 3), Power-of-Daleth raises to the fourth power, and so on. Pi-Search exposes Aleph and Bet at launch.

Are these findings claims, or just observations?

Observations, verified against the actual corpus. Pi-Search reports raw data. The interpretive and probabilistic arguments — what the findings mean, how to corrected for look-elsewhere, the priors that motivated checking these specific lengths and targets — belong to the foundational TFV research, not to this instrument.

What's on the roadmap?

Pi-Search currently exposes Power-of-Aleph (regular sum) and Power-of-Bet (squared sum) across the full 100B corpus. Future iterations include Power-of-Gimel (cubed) when findings call for it, deeper composite scan budgets, saved-finding registries for signed-in TFV members, and an open API for programmatic access — all of which compose with the current architecture without a redesign.

How do I cite Pi-Search and the corpus in academic work?

Suggested citations:

Pi-Search · The First Verse Project.
https://thefirstverse.com/Pi-Search/
Accessed YYYY-MM-DD.

For the underlying π dataset:

Peter Trueb (2016). 100 billion digits of π — first chunk of a 22.4-trillion-digit y-cruncher computation, sponsored by DECTRIS.
Internet Archive item: archive.org/details/pi_dec_1t.
Direct download: pi_dec_1t_01.zip.
Is the tool free?

Yes. Pi-Search is a free research tool. The underlying dataset is also freely downloadable. Heavier features in future versions may use the TFV credits system shared with other TFV tools.

Ready to search?

Open the tool. Type a number, a Hebrew word, a sum target, or build a composite query. Every answer is a real lookup against real π.