TorahBibleCodes Free Open Source Python
TorahBibleCodes Free Open Source Python
Daniel Azariah
TorahBibleCodes.com | AzariahBible.com
[email protected]
ABSTRACT: Presented here for academic peer-review is a preliminary pre-print (rough) draft
presentation of scientific (mathematical) confirmation of previous Equidistant Letter Sequence (ELS)
Torah Bible Codes discoveries, as well as revelations of new ones; The findings presented here can
(and must) also be scientifically challenged, tested, and confirmed or disproved. Also included here is a
proposal with details (to be refined in research) of Scientific Experimental Protocols and
Methodologies that improve upon pioneering prototype(s) of Witztum, Rips, and Rosenberg (WRR
1994) as well as the refinements of researchers who followed them. Our TorahBibleCodes ELS Search
Software is available for FREE DOWNLOAD via the website https://TorahBibleCodes.com 1 2 and
provides Free, Open-Source Python ELS Software Research Tools to make possible for others to
confirm and/or extrapolate continued research in this field and academic discipline(s) by providing
fully-customizable, expandable, scalable, free software in the Python language. The precise
mathematical data that is produced – by means of standardizing both identification and measurement –
allows for scientific, academic peer-review through standardization of units, IDs, test-measurements,
test variables, and controls across software tools and experiments for scientific, peer-reviewed,
academic biblical research.
Offered here is mathematical proof that G-D exists. For anyone who understands (or interested
in) statistics, chance, coincidence – and that things just don't happen randomly – the findings visually
presented here are both mathematically precise and scientifically confirmable. All the research data and
findings presented here are mathematically, statistically, as well as visually-verifiable.
1.0) Introduction
2.0) The ELS Search Algorithm
3.0) Equidistant Letter Sequences (ELSs)
1 Both the software and all the data that it produces are located on repositories located at:
https://GitHub.com/TorahBibleCodes
2 Direct Link: https://github.com/TorahBibleCodes/ResearchData_KorenCodexVsLeningradCodex
1
5.0) The Ancient Method of Visually Counting by Eye and Hand
6.0) Choosing a Size for the 2D Matrix
7.0) The Koren Codex
8.0) The Leningrad Codex
9.0) The Leningrad Codex vs. the Koren Codex
10.0) Unique VerseIDs, LetterIDs, WordIDs, and ELS IDs Coordinates System
1.0) Introduction
According to Isaac Newton [1642-1727 CE], if G-D spoke, He spoke to be understood. The
prophecies therefore must contain an ascertainable significance, straightforward and comprehensible to
the intellect, appropriate for all men without requiring the meditation of the learned.3
TorahBibleCodes is a collection of scientific bible research software tools that allow for not
only Equidistant Letter Sequence (ELS) Search (as this is just one functionality), but because it is open-
source, you can develop whatever you can imagine on top of existing functionalities, if you are able to
conceptualize and manifest your idea in Python, e.g. GUI, Gematria Machine Learning Algorithms
according to Letter, Word, and/or Verse Gematria Number Values, Totals, etc.
Is it possible to prove G-D exists? If so, how would it be done? Standing upon the shoulders of
previous scholars, and following and expounding upon the pioneering research of Witztum, Rips, and
Rosenberg (WRR)4 in the field of cryptographically hidden codes in the Book of Genesis of the
Hebrew Bible as Equidistant Letter Sequences (ELSs), it will be asserted here that it is possible to
mathematically (statistically) and scientifically prove the existence of the Master Encoder Creator G-D
– Who is outside of our physical, material 4D Space-Time domain – and to do so beyond any
reasonable doubt.
3 Mamiani 2002: 391-392
4 Witztum, Rips, and Rosenberg (WRR) 1994: 429-438
2
2.0) The ELS Search Algorithm
WRR's central search algorithm for each ELS Search Term, ELS (ELSx),5 is as follows:
As an initial scientific hypothesis (to be refined in research as led by the data), if anything is
going to be hidden and encrypted within the Hebrew Bible as Equidistant Letter Sequences (ELSs), the
term “The Messiah” is among the most central concepts in Judaism, and thus among the most likely to
be found as ELSs. Therefore, the following a priori ELS Search Terms (ELSx) – i.e. “Messiah” and
several permutations – will be chosen as our initial ELS Search-Term variables (ELSx) to initialize (and
search for) as per the protocol of WRR (1994) et al. WRR would define these ELS Search Terms as
initial word anchors (i.e. test-variables) within the text(s) that will anchor us to a 2D Matrix (in that
area) that will serve as a basis for a scientific experimental protocol and methodology:
k == length (k) of an ELS Search-Term, ELS, i.e. the number of letters in the word; here: The
length k of ELS1 is 5; the length of ELS2 is 5; the length of ELS3 is 4; the length of ELS4 is 7; the
length of ELS5 is 7; the length of ELS6 is 6;
d == equidistant skip distance(s) (d) between each letter in the ELS successfully found within
the selected text that is searched; For each instance of a letter found at letter position index number (n),
there may be multiple instances of skip distances (d) possible to the next letter in that ELS Match.
n == letter position index number starting position (n) for each instance for each first (or last)
letter in the ELS; For example, if you are searching for a word that begins (or ends) with the letter
Mem ( ם/ )מin the text, index number (n) is the index position number (n) for each instance found of
the letter Mem ( ם/ )מ, and for each instance of these letters Mem ( ם/ )מfound, there is the potential to
find multiple ELSs beginning (or ending) on that letter position index number (n).
WRR define (n, d, k) as the unique ELS ID for each ELS match.
3
WRR (1994), as well as the critics who challenged WRR's findings – i.e. BBK (1998) and
MBBK (1999)6 – only used ELS Search Terms (ELSx) with length (k) of 5-8 letters; However, we will
accept the 4-letter ELS Search Term, ELS3 ()משיח, “Mashiach” / “Messiah”, as acceptable for this
experimental scientific protocol and methodology(ies) because we will be executing the following
proposed experimental methodologies and steps:
In the late 1970s Dr. Eliyahu Rips, an Israeli Math Professor at the Hebrew University of
Jerusalem, began looking for hidden codes in the Torah with the help of a computer. In 1994 Doron
Witztum, Eliyahu Rips, and Yoav Rosenberg (WRR 1994) published an article in the peer-reviewed
journal, Statistical Science, entitled "Equidistant Letter Sequences in the Book of Genesis". In their
article, the researchers published their findings of an experiment that they conducted regarding
Equidistant Letter Sequences (ELS) - i.e. sequences of equally spaced letters - that are
cryptographically hidden within the text of the Book of Genesis.
6 i.e. Bar-Hillel, Bar-Natan, and McKay (1998); McKay, Bar-Natan, Bar-Hillel, and Kalai (1999)
4
One of the most basic qualities of a communication is its intelligibility to the receiver. The
Torah Code Hypothesis states that the Torah (the first five books of the Hebrew Bible) contains within
it letter sequences (codes) that were created intentionally, as a form of communication to human
beings, the intended receivers. Under the [scientifically-falsifiable] Null Hypothesis of No Torah
Codes, we would expect that strings found in the Torah would be no more intelligible than those found
in other (comparison) texts.7
According to the original Torah Code Hypothesis, logically or historically related words can be
found as ELSs in the Torah, associated with each other significantly more often and in a more compact
area than expected by chance. Many previous Torah code studies examined clustering of multiple ELSs
by measuring their proximity to each other in a [2D] matrix.8
To do the test of hypothesis, the p-value of the experiment is compared to a significance level
α0. If the p-value is smaller than α0, then the Null Hypothesis of No Torah Code effect is rejected in
favor of the alternative that the key word set has ELSs in an unusually compact arrangement. If the p-
value is larger than the significance level, the Null Hypothesis is not rejected.11
In his preface to that issue of the journal, the editor of Statistical Science, Professor Robert
Kass, made the following remark about the article by Witztum, Rips, Rosenberg (WRR):
“. . . When the authors used a randomization test to see how rarely the pattern they found might
arise by chance alone they obtained a very highly significant result, with p=0.000016. Our referees
were baffled: their prior beliefs made them think the Book of Genesis could not possibly contain
meaningful references to modern-day individuals, yet when the authors carried out additional analyses
and checks the effect persisted. The paper is thus offered to Statistical Science readers as a challenging
puzzle.”
In a public statement, Dr. Eliyahu Rips has stated, “The only conclusion that can be drawn from
the scientific research regarding the Torah codes is that they exist and that they are not a mere
coincidence.”
In a public statement, Dr. Doron Witztum has stated, “In codes research, we are dealing with a
similar situation: 1.) The credibility of serious codes research will be compromised by amateurs whose
'discoveries' are scientifically meaningless; 2.) People will exploit the Torah to present all kinds of
counterfeit proofs, by finding 'hidden messages', that bolster their ideology. We have a very important
and valuable phenomenon that has been discovered. It's a scientific discovery that can really help us get
a better understanding of the nature of our existence. Rather than have it watered down with people's
5
personal exploitation or misunderstanding, we should be investing more in serious research and
understanding of the phenomenon.”
In a public statement, Dr. Harold Gans (an expert NSA mathematical cryptographer) has stated,
“After exhaustive analysis, I have reached the conclusion that the only information that can be derived
from the codes discovered in Genesis is that they exist, and the probability that they are mere
coincidence is vanishingly small.”
In their paper that examined WRR's conclusions, entitled “Patterns of Equidistant Letter
Sequence Pairs in Genesis”, Gans, Inbal, and Bomboch (CITE CITATION: YEAR XXXX) conclude,
“The compactness of patterns formed on the surface of a cylinder by ELSs of a priori selected famous
Jewish personalities and ELSs of their communities of birth or death is smaller than can be attributed to
chance.”12
In another paper, Bombach and Gans (2006) conclude that the compactness of patterns formed
on the surface of a cylinder by co-linear ELSs and semantically related verses is smaller than can be
attributed to chance,13 and go so far as to assert that this Torah Codes phenomenon manifests itself in
the text of the entire Hebrew Pentateuch, and not just the text of the Book of Genesis.14
Indeed, there are those who extrapolate this idea, and theorize that this phenomenon of ELS
Torah Bible Codes is applicable to the entire Hebrew Bible, i.e. the Old Testament, in its entirety
beyond the Torah. Presented here is scientifically confirmable mathematical proof that indeed this is
so.
Other than publication of the initial findings by the pioneers, WRR, followed by several works
critical of WRR (Bar-Hillel, Bar-Natan, and McKay (1998); McKay, Bar-Natan, Bar-Hillel, and Kalai
(1999)), not much scientific research has been pursued in this field of Torah Bible Codes with
reproducible experiments according to the scientific method with unequivocal results that have been
repeatedly tested with confirmation or disproof.
Notable researchers who have supported WRR's conclusions are Gans, Levitt, Haralick,
Bombach, and a few others...(CITE CITATION, AUTHORS: YEARS)
According to Haralick, McKay et al.'s conclusion that criticized WRR was that the success of
the WRR experiment was due to choice in the input data of appellations and dates and not due to a
genuine ELS phenomena in Genesis.15
Although McKay et al.'s criticism (1998, 1999) of WRR's method and findings is not entirely
without some merit and logic, by following WRR's choice of a translation into Hebrew of War and
Peace as the control text for their experiment, McKay et al. use the same flawed text to test their
counter hypothesis – thereby proving nothing. Thus McKay et al.'s conclusions are misguided,
misinformed, and misgiven.
6
Testing the translation of War and Peace (from Russian or English?) into Hebrew only
demonstrates a flaw in one detail of WRR's experimental protocol (i.e. choosing variables for the
control text(s)), and proves the necessity to eliminate this variable as a choke-point for the repeatable
scientific experiments. An improved experimental protocol that takes proper control text(s) into
account will render moot this aspect of criticism of WRR's findings by allowing us to isolate the
fundamental variables that need to be defined, measured, and tested mathematically and statistically.
In the ancient Hebrew language, the word for Scribe is Sofer ( )סופר- literally one who “counts”
letters – with each letter also having a numerical value. Counting letters and their positions within the
word, verse, and entire text was part of the scribe's responsibilities, and certainly one of the means by
which the scribe ensured accuracy of the transcribed texts, e.g. counting the number of letters in that
verse that he just transcribed letter-by-letter: Mathematics never lies.
It is clear to anyone that studies the code that G-D is responsible for encoding them there:
Rabbi Bachya Ben Asher (1255-1340), Rabbi Moshe ben Yaakov Cordovero (1522-1570), Rabbi
Michael Dov Weissmandl (1958), WRR (1994), and those following WRR.
After choosing our a priori ELS Search-Terms – especially for Experimental Methodology 1 –
we will choose size(s) for 2D matrices; For Experimental Methodology 2, the size(s) of the 2D
matrices will be significant mostly for ease of human User Experience (UX).
Although 2D matrices of other sizes need to be tested for optimal UX, following the scientific
method, let us propose an experimental research protocol (i.e. Experimental Methodology 1) that is
based first upon objective, scientific observation of phenomena (to look for patterns of a priori
keywords, i.e. whatever words appear recognizable and visible within close proximity of the ELS
Search Term Anchors) in a 2D matrix crossword puzzle of initially 20 columns (width = x) by the
corresponding variable number of rows (height = y) for that particular biblical text selected.
Other than edge-case exceptions on either right or left side of the 2D Matrix helix, counting
letters in any of the 8 directions is an equidistant letter sequence: A column-width (x) of any integer
number, e.g. 20 or 9, or 10, 18, 27, 30, 33, etc., allows one to potentially find ELSs visually in any
linear direction:
1.) Up
2.) Down
3.) Right
4.) Left
5.) Diagonally Up Right
6.) Diagonally Down Right
7.) Diagonally Up Left
8.) Diagonally Down Left
7
Even if one is not mathematically-oriented, anyone can visually find ELSs (all of which are are
potentially possible hidden Torah Bible Codes) as if in a crossword (or word search) puzzle, and
nevertheless still be able to present the results to be confirmed by others scientifically and
mathematically. That is to say: Any discovery found visually – by anyone whomsoever – in these
Torah Bible Codes can be both visually and/or mathematically confirmed accurately to the level of
precise mathematics.
In order to disprove these results from this experiment, the ELS search-terms (variables) to be
searched, challenged – and either confirmed or disproved – must be the same variable ELS search-
terms used here: i.e. test these variables presented here, and this will eliminate the choice of variables
as a variable for the experiment itself. This will help to isolate truth from falsehood by having one less
unnecessary variable to differ between experiments.
The variables found and presented here from the Torah and/or specific books in the Hebrew
Bible must be used in the control text(s) in order to truly be able to confirm or disprove findings in the
experiment text. If these same ELS search-terms are found in any random control text(s), then there is
no statistical and mathematical significance to the findings presented here – this is the Null Hypothesis
that would provide scientific disproof.
On the other hand, if these same ELS search-terms are not found in any random control text(s)
in a similar way to the non-random order (i.e. ELSs clustered in groups in proximity, overlapping
letters, and crisscrossed words) that they are found here, then indeed there is something mathematically
(statistically) special about these Torah Bible Codes found here.
There is significance to clusters and groups of ELS search-terms found together in the same
area (context) of text. So scientific challenges using Random Daily Hebrew Newspaper Texts must use
the exact same terms provided here as a challenge, these ELSs must also be found in those texts, as
well as be clustered together (overlapping, crisscrossed, in close proximity, etc.) because random and
scattered ELSs are less significant.
The findings presented here are either true or false, 1 or 0: mathematics never lies.
Although there may be some advantages to various other 2D Matrix sizes, for our purposes here
for the Koren Codex Torah and/or Leningrad Codex Tanach, 20 rows seems an excellent (if not
optimal) initial choice: It is relatively easy on the eyes, and allows for easy searching of these hidden
codes (the ancient old-fashioned way) through counting by eye and hand with a base of ten (10), with
multiples of 2, 3, 4, 5, 6, 7, 8, 9, 10, and 20 (with single-digit +/- permutations) very easy and possible
to count and calculate.
With this size of 20 (and evidently any integer number of) columns for the 2D Matrix, certain
rules become evident after you begin your counting and search, with given: (x) = width = number of
columns; (y) = height = number of rows.
1.) Going up or down by one row is an exact ELS with a skip distance (d) that is exactly equal
the (x) number of columns, e.g. 20 columns here; For example, 20 columns of text here means that
going down vertically by one unit to the next row to the letter directly below it (-x, -y) is exactly +20
letters in the positive direction with an ELS skip distance (d) of +20.
8
2.) Conversely, going up vertically by one unit to the next row to the letter directly above it (x,
y) is exactly -20 letters in the negative direction with an ELS skip distance (d) of -20.
3.) Going down diagonally by one unit to the left (-x, -y) is an ELS skip distance (d) of +21
letters from that letter to the next letter.
4.) Going up diagonally by one unit to the right (x, y) is an ELS skip distance (d) of -21 letters
from that letter to the previous letter.
5.) Going down diagonally by one unit to the right (x, -y) is an ELS skip distance (d) of +19
letters from that letter to the next letter.
6.) Going up diagonally by one unit to the left (-x, y) is an ELS skip distance (d) of -19 letters
from that letter to the previous letter.
There are edge cases in using shortcuts (e.g. +/-Ax, +/-By by diagonal units) for counting and
placement as one approaches either side of the 2D Matrix helix as one goes up or down – so one must
be careful in counting as one reaches either left or right side of the row as one continues diagonally up
or down; Especially if one is counting by more than one unit in diagonal directions, the mathematics of
the movement must be correct.
The following formula, and its various graphical representations (e.g. vertical lines, horizontal
lines, and diagonal lines characterized by a dynamic L shapes (that can spin 360 degress on the (x,y)
plane), will help you to search, visualize, see, count, and find ELS word patterns in your word-search
by eye and hand:
y = mx + b
The Koren Codex used here is the one provided by Brendan McKay, perhaps the lead critic of
WRR. It is the same text(s) used by WRR. However, it is the Michigan-Claremont Transliteration of
the actual Hebrew Koren Codex. This was the codex evidently used by both WRR, as well as McKay
and his colleagues who were critical of WRR (1994).
This researcher16 requested directly from Koren a copy of their digitized Codex of the actual
Koren Hebrew for this research, analysis, and comparison between the two Masoretic Codices analyzed
here. However, Koren declined to share the text or cooperate in open-source scientific research of their
codex.
Therefore, here are the source texts used for the Koren data provided here:
http://users.cecs.anu.edu.au/~bdm/codes/statsci/data.html
16 D. Azariah 2023
9
8.0) The Leningrad Codex
The Leningrad Codex used here is the one provided by Sefaria.org, and forked from their
GitHub repo to the TorahBibleCodes here:
https://github.com/TorahBibleCodes/Sefaria-Export
Additionally, here is a direct link to the original Sefaria GitHub repo from which the texts for
this program have been taken:
https://github.com/Sefaria/Sefaria-Export
Within the Leningrad Codex Torah, there are 304,850 letters compared with Koren Codex
Torah's 304,805 letters, i.e. a difference of 45 letters.
The Leningrad Codex Torah contains 79,982 words whereas the Koren Codex Torah contains
79,976 words, i.e. a difference of 6 words.
The Leningrad Codex Torah contains 5846 verses vs. Koren Codex Torah with 5847 verses.
This single one verse difference is to be found in Koren Codex Torah in the Book of Numbers 25:19 vs.
Leningrad Codex Torah Book of Numbers concluding chapter 25 at verse 18 with no verse 19. Koren
Numbers 25:19 evidently takes the first three words ( )ויהי אחרי המגפהfrom Leningrad Numbers 25:18
as its first (and only) three words in Koren Numbers 25:19.
10.0) Unique VerseIDs, LetterIDs, WordIDs, and ELS IDs Coordinates System
In order for us to share and peer-review precise mathematical, statistical, and visual data that is
produced from TorahBibleCodes research software tools, we build upon a unique 3-integer VerseID,
unique for each Book, Chapter, and Verse within the Hebrew Canon. Here we demonstrate the ID
system for the Leningrad Codex of the entire Hebrew Bible together as one text string of letters (please
see Section 12.0 Appendix below for figures of data).
This 3-integer VerseID is unique to each verse within each separate Book within the Hebrew
Bible.
EXAMPLE:
10
(5, 34, 10) == (Deuteronomy, 34, 10) == Deuteronomy 34:10
(5, 34, 11) == (Deuteronomy, 34, 11) == Deuteronomy 34:11
(5, 34, 12) == (Deuteronomy, 34, 12) == Deuteronomy 34:12
Building upon this unique 3-integer Verse ID, we create several multiple, overlapping (yet each
unique) WordIDs and LetterIDs for each Word and Letter respectively within each Codex Text:
This 4-integer LetterID will be unique to each individual letter with each separate Book in the
Hebrew Bible, and it is one way (of several) to uniquely identify letter(s) in our Hebrew Codices; It is
helpful when you need to know the exact letter position index number (n) within that particular verse.
EXAMPLE:
This 5-integer LetterID is another way to uniquely identify each letter within a text. However,
this 5-integer LetterID also takes into account the length of the total text, e.g. here the entire Hebrew
Bible (1,197,042 letters for Leningrad), but also possible only the Torah (304,850 letters17 for
Leningrad), or only the Prophets (553,785 letters for Leningrad), or only the Writings (338,407 letters
for Leningrad).
EXAMPLE:
(35, 12, 10, 48, 1059159) == (Daniel, 12, 10, Letter 48 in Verse, Letter 1059159 in Text)
(35, 12, 12, 7, 1059223) == (Daniel, 12, 12, Letter 7 in Verse, Letter 1059223 in Text)
This 5-integer LetterID is useful because the 5th integer is the same number as the variable for
index letter position (n) for each ELS found, and therefore is the primary key when connecting to the
unique ELS ID (n, d, k) of each ELS found:
Thus the above 5-integer LetterIDs are the same letters (and letter positions) that are identified
11
with WRR's unique ELS identifier (n, d, k):
EXAMPLE:
k == length of ELS term (k), e.g. for (n, d, k) == (1059223, 9, 5), the length (k) is 5 ()המשיח,
“HaMashiach”, “The Messiah”.
d == skip distance (d), i.e. here (d) is a skip distance (d) of 9 in the negative direction; Our
program uses absolute values for computation, i.e. begins on both the first and last letters of the ELS
and searches in the positive (forward) direction. Therefore the ELS ID (n, d, k) for negative skip
distances (d) is associated with the last letter of the ELS as the primary (beginning) letter in that
negative ELS match;
Whereas other code researchers (and software) may be identifying only the first letter of the
ELS and doing both a positive and negative search, our program and algorithm searches for both first
and last letters of each ELS Search Term, and only searches in the positive (forward) direction. This is
the same as finding the first letter in the ELS and searching in both positive (forward) and negative
(backward) directions; Therefore, our ELS ID (n, d, k) identifies the first letter of the ELS when it is a
“positive” skip-distance (d), and it identifies the last letter of the ELS when it is a “negative” skip-
distance (d);
For our data, if one prefers, one can very quickly customize the output to display negative signs,
e.g. (1059159, -3, 4) or (1059223, -9, 5); Since we use absolute values in the CSV files for both ELS
search directions and data output, you must look at the file name in the top left of your Word Processor
to see if the file contains the word POSITIVE or NEGATIVE in the title, or see it clearly in the data by
context; the positive and negative ELS matches are each contained in separate CSV files, and ordered
by the smallest skip-distance (d) in ascending order.
n == letter position index number starting position (n) for the first (or final/last) letter in the
ELS Search-Term; Since this is a negative skip distance (d), the ELS Search Match begins with the
final letter of the ELS Search-Term, i.e. here for (n, d, k) = (1059223, -9, 5) == (1059223, 9, 5) == the
letter ( )חHET ()המשיח, “HaMashiach”, “The Messiah”.
EXAMPLE:
12
EXAMPLE:
(35, 12, 10, 10, 272344) == (Daniel, 12, 10, Word 10 in Verse, Word 272344 in Text)
(35, 12, 12, 2, 272358) == (Daniel, 12, 12, Word 2 in Verse, Word 272358 in Text)
The ELS codes (i.e. ELS Search-Term Matches) presented here can be mathematically located
and confirmed to the level of that specific letter with its various unique IDs to identify letter position
index number (n) for that letter.
Of special note are the three (3) instances of “The Messiah” appearing in Nehemiah 12 (See
Section 12.0 Appendix).
For the accompanying CSV files in the 2D Matrix, the exact verse and letter position(s) of the
both the first and last letters of each row are available on the right and left sides respectively of each
row with a 5-integer LetterID.
For any text chosen in a 2D Matrix of 20 column-width, the first and last rows would be
quantified (as detailed and displayed in Section 12.0 Appendix), with numbers indicating the exact
letter position of the letter on the either left or right of the 2D Matrix; Thus whether one be
mathematically, statistically, or visually-inclined, others can scientifically confirm any discovery made
by anybody via this unique VerseID, LetterID, WordID, and ELS ID Coordinates System.
When we analyze these two Hebrew Codices, Koren Codex vs. the Leningrad Codex, at the
level of precise mathematical positions of each letter, the results are fascinating and prove how reliable
the ancient Hebrew scribes were in both codices: The only differences are Matres Lectionis, which are
trivial.
Questions arise which verses are more accurate to the original text? In some places, it looks like
Koren has the older style of writing; in other places, it looks like Leningrad. Future plans for this
project include finding digitized versions of the Koren Tanach in its entirety, as well as what remains
from the Aleppo Codex, Sassoon Codex, along with whatever other Hebrew Codices (or individual
books or texts) that exist, e.g. Scroll of Isaiah of the Dead Sea Scrolls, etc.
12.0) APPENDIX (PREPRINT SAMPLE FINDINGS) – PLEASE SEE ALSO CSV FILES OF
ALL RESEARCH DATA AVAILABLE via / at:
https://TorahBibleCodes.com
https://github.com/TorahBibleCodes
13
Figure 12.1 – Sample Data: Details of words and letters in the Selected Text(s)
Figure 12.2 – ELS Search Terms found in Koren Codex Instruction (TORAH)
14
Figure 12.3 – ELS Search Terms found in Leningrad Codex Instruction (TORAH)
Figure 12.4 – ELS Search Terms found in Leningrad Codex Prophets (NEVI'IM)
15
Figure 12.5 – ELS Search Terms found in Leningrad Codex Writings (K'TUVIM)
Figure 12.6 – ELS Search Terms found in Leningrad Codex Hebrew Bible (TANACH)
16
Figure 12.7 - “HaMashiach” // “The Messiah” ( )המשיחin 2D Matrix with X == 20;
Skip-Distance (d) == (-9); Daniel 12: 12-13;
17
Figure 12.9 - “He had compassion” // “He has compassion” ( )חמלin 2D Matrix with X == 20;
Skip-Distance (d) == (-19); Daniel 12: 12-13;
Figure 12.10 - “He pardoned” // “He pardons” ( )מחלin 2D Matrix with X == 20;
Skip-Distance (d) == (-21); Daniel 12: 12-13;
18
Figure 12.11 – All of the above in 2D Matrix with X == 9; Daniel 12: 12-13;
Figure 12.12 - “He pardoned them” ( )מחלםand “You were compassionate” // “Compassion of /
for [something]” ( )חמלתin 2D Matrix with X == 20; Skip-Distance (d) == (-21) and (-19); Daniel
12: 11-13;
19
Figure 12.13 – All of the above in 2D Matrix with X == 9; Daniel 12: 11-13;
20
Figure 12.15 - “He will pardon” ( )ימחלin 2D Matrix with X == 9;
Skip-Distance (d) == (+10); Daniel 12: 12-13;
Figure 12.16 - “Who pardoned?” // “Who pardons?” ( )מי מחלin 2D Matrix with X == 9;
Skip-Distance (d) == (+10); Daniel 12: 12-13;
21
Figure 12.17 - “I will rule” // “I will govern” ( )אמשלand “He [has] ruled” // “He rules” // “Ruler
” // “Governor” ( )משלin 2D Matrix with X == 9; Skip-Distance (d) == (+19); Daniel 12: 11-13;
Figure 12.18 - “I will rule you” // “I will govern you” ( )אמשלךand “He [has] ruled you” // “He
rules you” // “Your Ruler” // Your Governor” ( )משלךin 2D Matrix with X == 9; Skip-Distance
(d) == (+19); Daniel 12: 11-13;
22
Figure 12.19 - “Yishai” // “Jesse” ( )ישיin 2D Matrix with X == 9;
Skip-Distance (d) == (+10 and -10); Daniel 12: 12;
23
Figure 12.21 - “[Compassion of / for] a people” ( )עםin 2D Matrix with X == 9;
Skip-Distance (d) == (multiple instances; various skip distances (d)); “Compassion for the people
of the Messiah” ( ;)חמלת עם המשיחDaniel 12: 11-13;.
Figure 12.22 - “I will rule” // “I will govern” ( )אמשלand “He [has] ruled” // “He rules” // “Ruler
” // “Governor” ( )משלin 2D Matrix with X == 9; Skip-Distance (d) == (-1); Daniel 12: 12;
24
Figure 12.23 - “Yishai” // “Jesse” ( )ישיin 2D Matrix with X == 9;
Skip-Distance (d) == (+9 and -9); Daniel 12: 11-12;
25
Figure 12.25 - “There is [i.e. exists] YAH” ( )יש יהin 2D Matrix with X == 9;
Skip-Distance (d) == (+10); Daniel 12: 12-13;
Figure 12.26 - “[He is] dead” // “[He] died” // “[The] Death of [someone]”( )מתin 2D Matrix with
X == 9; Skip-Distance (d) == (+8 and +16 and +16 and +24); Daniel 12: 12-13;
26
Figure 12.27 - “[He] will die” ( )ימתin 2D Matrix with X == 9;
Skip-Distance (d) == (+16); Daniel 12: 12-13;
27
Figure 12.29 - “My Messiah” ( )משיחיin 2D Matrix with X == 9;
Skip-Distance (d) == (+20); Daniel 12: 7-9;
Figure 12.30 – All of the above in 2D Matrix with X == 9; Daniel 12: 7-13;
28
Figure 12.31 - “My Messiah” ( )משיחיin 2D Matrix with X == 20;
Skip-Distance (d) == (-66); Daniel 9: 20-24;
29
Figure 12.33 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+5); Genesis 18: 14;
30
Figure 12.35 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+7); Haggai 1:1;
31
Figure 12.37 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+8); Leviticus 16: 32;
32
Figure 12.39 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+10); Judges 21: 6-7;
33
Figure 12.41 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+10); II Kings 18: 10-11;
34
Figure 12.43 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+13); Exodus 13: 22 – 14: 2;
35
Figure 12.45 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+14); Deuteronomy 1: 37-38;
36
Figure 12.47 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+18); I Samuel 9: 22-24;
37
Figure 12.49 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+20); Genesis 3: 7-8;
38
Figure 12.51 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+24); Nehemiah 12: 16-21;
39
Figure 12.53 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+25); Nehemiah 12: 30-31;
40
Figure 12.55 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+26); Ezekiel 7:26 – 8:1;
41
Figure 12.57 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+27); Psalms 68: 29-31;
42
Figure 12.59 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+28); Exodus 15: 25-26;
43
Figure 12.61 - “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+30); Genesis 16: 1-12;
44
Figure 12.63 “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (+32); Isaiah 55: 11-13;
45
Figure 12.65 “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (-3); Judges 7: 11;
46
Figure 12.67 “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (-3); II Kings 15: 27;
47
Figure 12.69 “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (-3); II Chronicles 33: 19-20;
48
Figure 12.71 “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (-5); Numbers 26: 38-39;
49
Figure 12.73 “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (-9); Daniel 12: 12-13;
50
Figure 12.75 “The Messiah” ( )המשיחin 2D Matrix with X == 9;
Skip-Distance (d) == (-10); Genesis 33: 7-8;
Figure 12.76 – Analysis (SUMMARY): Leningrad Codex Torah vs. Koren Codex Torah
51
Figure 12.77 – Analysis: Leningrad Codex Genesis vs. Koren Codex Genesis
Figure 12.78 – Analysis: Leningrad Codex Exodus vs. Koren Codex Exodus
52
Figure 12.79 – Analysis: Leningrad Codex Leviticus vs. Koren Codex Leviticus
Figure 12.80 – Analysis: Leningrad Codex Numbers vs. Koren Codex Numbers
53
Figure 12.81 – Analysis: Leningrad Codex Deuteronomy vs. Koren Codex Deuteronomy
בע"ה
If you feel blessed by this scientific biblical research (and dropping of knowledge), please consider
supporting financially the continued research, R&D, shared free software, data, discoveries, and
insights.
Or via the contact details below to donate and support privately and confidentially.
Daniel Azariah
AzariahBible.com
TorahBibleCodes.com
[email protected]
Jerusalem, Israel
14.0) References:
54
Bombach, N.; Gans, H.; "Patterns of Co-Linear Equidistant Letter Sequences and Verses", 2006, pp. 1-
3.
https://www.researchgate.net/publication/220930153_Patterns_of_Co-
Linear_Equidistant_Letter_Sequences_and_Verses
Gans, H.; Inbal, Z.; Bombach, N.; "Patterns of Equidistant Letter Sequence Pairs in Genesis", 2005, pp.
XXX-XXX
https://www.semanticscholar.org/paper/Patterns-of-Equidistant-Letter-Sequence-Pairs-in-Gans-
Inbal/44d1a1158127212969169accea4e2a1ff3ea60e7
Haralick, R.M.; Basic Concepts For Testing The Torah Code Hypothesis, 2006A, pp. 1-6.
Haralick, R.M.; Testing The Torah Code Hypothesis: The Experimental Protocol, 2006B, pp. 1-6.
Haralick R.M.; "Torah Codes: New Experimental Protocols", 1998, pp. 1-23.
Levitt, A.; Haralick, R.M.; Rips, E.; "Linguistic Connections among Torah Codes 29 November 2004",
2004, pp. 1-5.
Levitt, A.; Nachum B.; Gans, H.; Haralick, R.; Schwartzman, L.; Stal, C.; "Long Phrases in Torah
Codes", 2004, pp. 1-4.
https://www.academia.edu/21523850/Long_Phrases_in_Torah_Codes
https://www.researchgate.net/publication/242139408_Long_Phrases_in_Torah_Codes
Mamiani, M; “Newton on Prophecy and the Apocalypse”, 2002, pp. 387 - 408, within: The Cambridge
Companion to Newton, (Editors: Cohen, I.B. and Smith, G.E.), Cambridge University Press,
Cambridge, New York, 2002, pp. 1 – 500.
McKay, B.; Bar-Natan, D.; Bar-Hillel, M.; Kalai, G.; "Solving the Bible Code Puzzle", Statistical
Science, 14(5), May 1999, 1999, pp. 150-173.
Wilson, J.; “Bible Code, Revisited”; Perspectives on Science and Christian Faith, Volume 71, Number
1, March 2019, 2019, pp. 3-15.
Witztum, D.; Rips, E.; Rosenberg, Y.; "Equidistant Letter Sequences in the Book of Genesis",
Statistical Science, 9(3), 1994, pp. 429-438.
55