What does Tzolkin Gears and Gate Networks conclude, in numbers, about “Base Rates, the Information in Labels and Two Pre-Registered Studies”?
Answer: Chapter 8 gives the base rates of coincidence, the entropy of the labels and two pre-registered studies: blind recognition needing 359 participants and an oracle-tie study needing about 8561 couples. 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: 359, 8561
| (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) couple tied either way | 0.01752 |
| couples to recruit for 150 tied couples | 8561 |
Show the full program
# Chapter 8. p16: Two pre-registered studies and their sizes.
# (A) Blind recognition: each participant reads four type-and-profile
# descriptions written from four different charts (theirs and three
# strangers' matched to differ in type), with labels removed, and picks
# the one most like them. Chance 1/4; exact one-sided binomial test,
# alpha 0.05, power 0.90.
# (B) Oracle ties and couples: the claim that a partner who is one's
# analog, antipode, occult or guide makes a different relationship.
# One is in the other's oracle for 0.01455 of ordered pairs (p05);
# here we count unordered couples tied in either direction, and how
# many couples must be recruited to observe 150 tied couples.
from itertools import product
from math import comb, ceil
KINS = list(product(range(20), range(1, 14)))
def oracle(k):
s, t = k
return {((s + 12 * (t - 1)) % 20, t), ((19 - s) % 20, t),
((s + 10) % 20, t), ((21 - s) % 20, 14 - t)} - {k}
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))
tied = sum(1 for a, b in product(KINS, KINS)
if a != b and (b in oracle(a) or a in oracle(b)))
either = tied / (260 * 259)
print(" (B) couple tied either way: {:.5f}".format(either))
print(" couples to recruit for 150 tied couples: {}".format(
ceil(150 / either)))Single source and citation
Fan, Y. (2026). Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation (Version 1.0.0), Chapter 8: Base Rates, the Information in Labels and Two Pre-Registered Studies. 5D Library. https://doi.org/10.5281/zenodo.24090193
DOI: 10.5281/zenodo.24090193 · Read the monograph · 5DL-B-072 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026072,
author = {Fan, Yafu},
title = {Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090193},
url = {https://doi.org/10.5281/zenodo.24090193}
}Other chapter answers in this book
- Chapter 1 · The Tzolkin as Two Coprime Gears
- Chapter 2 · The Long Count, Two Correlation Constants and the Dreamspell Count
- Chapter 3 · The Five-Part Oracle: Involutions and a Group Action on Signs and Tones
- Chapter 4 · The Sixty-Four-Gate Wheel and the Channel-Centre Graph
- Chapter 5 · Gate Activation and Channel Percolation in the Independence Model
- Chapter 6 · Base Rates in the Real Sky: an Ephemeris, Correlated Activations and Twelve Profiles
- Chapter 7 · The Venus Table of the Dresden Codex and the Xiantian Circle