Preston Kavanagh, «The Jehoiachin Code in Scripture’s Priestly Benediction», Vol. 88 (2007) 234-244
Coding in the OT is plausible because of the Exile’s profusion of scripture, the Diaspora’s need for secure communication, and the ancient world’s widespread use of cryptography. A code exists in Num 6,24-26 that uses one letter per text word, from words spaced at regular intervals, with letters used in any sequence. Coding of Jehoiachin’s name in the MT’s Priestly Benediction establishes the mid-sixth century B.C.E. as the earliest possible time for the Ketef Hinnom amulets. Moreover, since the Ketef Hinnom scribe appears to have understood nothing of the benediction’s Jehoiachin coding, the amulets could be considerably later than mid-sixth century.
The Jehoiachin Code in Scripture’s Priestly Benediction 241
computer selected the nine with highest values, five of them with A and four
with B. Cushi, Shecaniah, and three versions of Jehoiachin earned an A. Each
had a Spellings/Opportunities ratio in the Priestly Benediction that was equal
to or higher than its top value in computerized searches of the large sample.
An A means the ratio is at least as good as the best ratio in the sample; B is
the same or better than the second-best ratio. It is easiest to think of them
simply as best and second-best. In this study, five names are best, four are
second-best, and 447 are also-rans.
The run of Jehoiachin variations is extraordinary. All six Jehoiachin
variations (and just three other names) reach the top nine in a field of 456. If
the author acted intentionally, it is hard to say which version he or she wished
to emphasize. The Jehoiachin spellings each possessed at least three of the
same Hebrew letters, so commonality might have had a little to do with this
abundance (24). But the author would have been as aware as we are that
Jehoiachin could be written many ways, and he or she seems to have selected
the benediction’s words, spacing, and grammar to give maximum play to
every version.
Examining individual spellings, two Jehoiachin versions — hynwky and
ˆykywy — convert fourteen of fifteen opportunities into coded spellings.
Fourteen of fifteen! For this performance each of those wins an A. For other
versions, the ratios are ten of twelve, and thirteen and fifteen of twenty-one.
The shortest encoding is ˆkwy. It comes from the jar-handle inscription, and
rates a B value for its twenty-one spellings in thirty opportunities. The rest of
Numbers chapter 6 is bare of any A or B Jehoiachin values, but there is what
could be considered an exception.
Though the Priestly Benediction is an entity, an editor has framed it by a
two-verse introduction (Num 6,22-23) and a single verse that concludes the
chapter. Verse 23 ends with µhl, “to them.†The unknown editor strengthened
coding of several Jehoiachin spellings by placing this word at the front edge
of the benediction. Inclusion of µhl improves the spellings/opportunities ratio
of ˆykywhy from ten of twelve to twelve of fourteen. Using µhl as a source of
letters also brought whynk to seventeen (from fifteen) spellings in twenty-one
opportunities. This is especially interesting because it raises whynk from a B to
an A value (table 2 uses the B). One doubts that this reinforcement was
coincidental.
Before drawing final conclusions about any code, readers may wish to
verify the letter sequences in each table. Table 1 is self-evident, and for table
2 the note supplies what is needed to trace the other Jehoiachin versions (25).
(24) Though eight of the nine words that recorded an A or a B shared three common
letters (y, k, n), there are nine other Hebrew personal names with those same letters that did
not score A or B. Also, fifty-three of the 456 personal names shared w, h and y but only six
made the list. Common letters may have had influence, but they were certainly not
determinative.
(25) Starting words within verses (24-2, 25-1, etc.) and intervals (1, 2, etc.) are shown
for spellings 4 through 8 in table 2. For hynky: (1) 24-2, 3; 25-1, 2, 3, 4, 5; 26-2; (2) 24-2, 3;
25-1, 3; (3) 24-2. For hynwky: (1) 24-1, 2, 3; 25-2, 3, 4, 5; 26-1, 2; (2) 24-1, 2, 3; 25-1, 2. For
whynk: (1) 24-2, 3; 25-1, 2, 3, 4, 5; 26-1, 2; (2) 24-2, 3; 25-1, 2, 3; (3) 24-2. For ˆykywhy: (1) 24-
1, 2; 25-2, 3, 4, 5; 26-1; (2) 24-1, 2, 3. For ˆkwy: (1) 24-3; 25-1, 2, 3, 4, 5; 26-1, 2, 3; (2) 24-
2, 25-1, 2, 3, 4, 5; (3) 24-2, 3; 25-2, 3; (4) 24-2, 3.