What does Tarot, Lenormand and Tree Graphs conclude, in numbers, about “A Four-Step Check and Two Pre-Registered Studies”?
Answer: Chapter 8 gives a four-step check and two pre-registered studies: a blind matching test needing 359 participants and a shuffle audit needing 263 spreads. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
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: 263, 359
| (A) hit rate 0.32 vs 0.25 | 359 participants, at least 104 hits |
| exact size 0.0485 | |
| (A) hit rate 0.35 vs 0.25 | 179 participants, at least 55 hits |
| exact size 0.0485 | |
| (B) mean changes 4.2 vs 4.5 | 263 audited spreads |
| (B) mean changes 4.0 vs 4.5 | 95 audited spreads |
| Reading: the matching test needs a few hundred participants; | |
| the shuffle audit is cheap, because orientation is mechanical. |
Show the full program
# Chapter 8. p16: Two pre-registered studies and their sizes.
# (A) Blind matching: each participant receives four unlabelled Celtic
# Cross readings written by an interpreter who never meets them: one
# from a spread dealt for their question, three from spreads dealt for
# other participants. Chance of choosing their own: 1/4. Exact
# one-sided binomial test, alpha 0.05, power 0.90.
# (B) Shuffle audit: readers shuffle as they always do; we record the
# orientation of the top 10 cards. Under independent turning the
# number of changes has mean 4.5 and s.d. 1.5. Size to detect a mean
# of 4.2 (a mild clustering) two-sided at 0.05 with power 0.90.
from math import comb, ceil
from statistics import NormalDist
def tail(n, k, p):
return sum(comb(n, i) * p ** i * (1 - p) ** (n - i)
for i in range(k, n + 1))
def plan(p0, p1, alpha=0.05, power=0.90):
for n in range(20, 5000):
k = next(k for k in range(n + 1) if tail(n, k, p0) <= alpha)
if tail(n, k, p1) >= power:
return n, k, tail(n, k, p0)
if __name__ == "__main__":
for p1 in (0.32, 0.35):
n, k, a = plan(0.25, p1)
print(" (A) hit rate {:.2f} vs 0.25: {} participants, at least {}"
" hits".format(p1, n, k))
print(" exact size {:.4f}".format(a))
z = NormalDist().inv_cdf
for mu1 in (4.2, 4.0):
n = ceil(((z(0.975) + z(0.90)) * 1.5 / (4.5 - mu1)) ** 2)
print(" (B) mean changes {:.1f} vs 4.5: {} audited spreads".format(
mu1, n))
print("\nReading: the matching test needs a few hundred participants;")
print("the shuffle audit is cheap, because orientation is mechanical.")Single source and citation
Fan, Y. (2026). Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs (Version 1.0.0), Chapter 8: A Four-Step Check and Two Pre-Registered Studies. 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 7 · The Sefer Yetzirah, Kircher's Tree and Waite's Numbering