What does Tarot, Lenormand and Tree Graphs conclude, in numbers, about “The Sefer Yetzirah, Kircher's Tree and Waite's Numbering”?
Answer: Chapter 7 reads the Sefer Yetzirah, Kircher's tree and Waite's numbering of 1910: Kircher lettered the paths in alphabetical order, so only 11 letters fall on paths matching their classes of three, seven and twelve.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 11, 1910
| path shapes | 3 horizontal, 7 vertical, 12 diagonal |
| horizontal paths carrying a letter of that class | 0 of 3 |
| vertical paths carrying a letter of that class | 3 of 7 |
| diagonal paths carrying a letter of that class | 8 of 12 |
| Kircher order | 11 of 22 letters match |
| expected under a random lettering | 101/11 = 9.182 |
| letterings with every class on its shape | 14,485,008,384,000 |
| share of all 22! letterings | 1.289 x 10^-8 |
| gates (unordered letter pairs): C(22, 2) | 231 |
| Marseille Strength 11, Justice | 8: card n on path n + 11 for 20 of 22 |
| Waite 1910 Strength | 8, Justice 11: card n on path n + 11 for 22 of 22 |
| path 19 = teth, path 22 = lamed |
Show the full program
# Chapter 7. p15: Three mothers, seven doubles, twelve simples - letters
# on the paths of the Kircher tree, and the Waite swap.
# Sefer Yetzirah divides the 22 letters into 3 mothers (aleph, mem, shin),
# 7 doubles (beth, gimel, daleth, kaph, pe, resh, tav) and 12 simples.
# The tree has 3 horizontal, 7 vertical and 12 diagonal paths. Kircher
# lettered the paths in order (aleph on 1-2, beth on 1-3, ...). How many
# letters fall on a path of "their" geometric type, against chance?
# Then: the 231 "gates" (pairs of letters), and what changes when Waite
# (1910) gives Strength the number 8 and Justice 11.
from fractions import Fraction
from math import comb, factorial
PATHS = [(1, 2), (1, 3), (1, 6), (2, 3), (2, 6), (2, 4), (3, 6), (3, 5),
(4, 5), (4, 6), (4, 7), (5, 6), (5, 8), (6, 7), (6, 9), (6, 8),
(7, 8), (7, 9), (7, 10), (8, 9), (8, 10), (9, 10)]
LETTERS = ["aleph", "beth", "gimel", "daleth", "he", "vav", "zayin",
"heth", "teth", "yod", "kaph", "lamed", "mem", "nun", "samekh",
"ayin", "pe", "tsadi", "qoph", "resh", "shin", "tav"]
MOTHER = {"aleph", "mem", "shin"}
DOUBLE = {"beth", "gimel", "daleth", "kaph", "pe", "resh", "tav"}
COLUMN = {1: 1, 2: 2, 3: 0, 4: 2, 5: 0, 6: 1, 7: 2, 8: 0, 9: 1, 10: 1}
LEVEL = {1: 0, 2: 1, 3: 1, 4: 2, 5: 2, 6: 3, 7: 4, 8: 4, 9: 5, 10: 6}
def shape(a, b):
if LEVEL[a] == LEVEL[b]:
return "horizontal"
return "vertical" if COLUMN[a] == COLUMN[b] else "diagonal"
def kind(letter):
if letter in MOTHER:
return "horizontal"
return "vertical" if letter in DOUBLE else "diagonal"
if __name__ == "__main__":
shapes = [shape(a, b) for a, b in PATHS]
print(" path shapes: " + ", ".join(
"{} {}".format(shapes.count(s), s)
for s in ("horizontal", "vertical", "diagonal")))
match = [kind(l) == s for l, s in zip(LETTERS, shapes)]
for s, size in (("horizontal", 3), ("vertical", 7), ("diagonal", 12)):
k = sum(m for m, x in zip(match, shapes) if x == s)
print(" {:10s} paths carrying a letter of that class: {} of {}"
.format(s, k, size))
print(" Kircher order: {} of 22 letters match".format(sum(match)))
exp = Fraction(3 * 3 + 7 * 7 + 12 * 12, 22)
print(" expected under a random lettering: {} = {:.3f}".format(
exp, float(exp)))
full = factorial(3) * factorial(7) * factorial(12)
print(" letterings with every class on its shape: {:,}".format(full))
print(" share of all 22! letterings: {:.3f} x 10^-8".format(
full / factorial(22) * 1e8))
print(" gates (unordered letter pairs): C(22, 2) = {}".format(
comb(22, 2)))
# Golden Dawn letters by symbol: teth (Leo) for Strength, lamed
# (Libra) for Justice; every other major n sits on path n + 11.
gd = {"Strength": 19, "Justice": 22}
for name, numbers in (("Marseille", {"Strength": 11, "Justice": 8}),
("Waite 1910", {"Strength": 8, "Justice": 11})):
ok = 20 + sum(numbers[c] + 11 == gd[c] for c in gd)
print(" {:10s} Strength {:2d}, Justice {:2d}: card n on path n + 11"
" for {} of 22".format(name, numbers["Strength"],
numbers["Justice"], ok))
print(" path 19 = {}, path 22 = {}".format(LETTERS[8], LETTERS[11]))Single source and citation
Fan, Y. (2026). Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs (Version 1.0.0), Chapter 7: The Sefer Yetzirah, Kircher's Tree and Waite's Numbering. 5D Library. https://doi.org/10.5281/zenodo.24090191
DOI: 10.5281/zenodo.24090191 · Read the monograph · 5DL-B-071 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026071,
author = {Fan, Yafu},
title = {Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090191},
url = {https://doi.org/10.5281/zenodo.24090191}
}Other chapter answers in this book
- Chapter 1 · Hypergeometric Sampling of Seventy-Eight Cards
- Chapter 2 · Shuffles, Mixing Times and the Correlation of Reversals
- Chapter 3 · The Grid Combinatorics of the Lenormand Grand Tableau
- Chapter 4 · The Tree of Life as a Graph: Spectrum, Centrality and Paths
- Chapter 5 · Information, Repeats and the Base Rate of "Something Special"
- Chapter 6 · The Barnum Effect: a Coverage Model and Selective Recall
- Chapter 8 · A Four-Step Check and Two Pre-Registered Studies