What does Tzolkin Gears and Gate Networks conclude, in numbers, about “Gate Activation and Channel Percolation in the Independence Model”?
Answer: Chapter 5 computes exactly in a model of independent uniform activations: a single chart activates 21.5033 gates and conducts 3.9603 channels on average, with probability 0.00462 that none conducts; a two-person composite conducts 11.1618.
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: 0.00462, 11.1618, 21.5033, 3.9603
| check | 64(1 - (63/64)^26) = 21.5033 |
| 26 draws: distinct gates E | 21.5033, s.d. 1.6338 |
| most likely 22 gates (P | 0.2362) |
| P(no channel conducts) | 0.00462 |
| channels conducting: E[C] | 3.9603, Var[C] = 2.5290 |
| P(a given channel conducts) | 0.11001 |
| 52 draws: distinct gates E | 35.7818, s.d. 2.3607 |
| most likely 36 gates (P | 0.1680) |
| P(no channel conducts) | 6.662 x 10^-9 |
| channels conducting: E[C] | 11.1618, Var[C] = 5.5687 |
| P(a given channel conducts) | 0.31005 |
Show the full program
# Chapter 5. p08: The independence model, exactly - one chart (26 draws)
# and a two-person composite (52 draws).
# Suppose the 26 activations (13 bodies, two moments) were independent and
# uniform over the 64 gates (each gate is 5.625 degrees wide). Then:
# - the number of distinct gates hit has the occupancy law
# P(D = j) = C(64, j) j! S(26, j) / 64^26 (S = Stirling, 2nd kind);
# - a channel conducts when both its gates are hit; the gate graph is K4
# (10, 20, 34, 57) plus 30 disjoint pairs, so its independent sets are
# counted by (1 + 4x)(1 + 2x)^30, and
# P(no channel) = sum_j [x^j] * j! S(26, j) / 64^26;
# - E[C] and Var[C] follow from P(a given set of m gates all hit).
from fractions import Fraction
from math import comb, factorial
G = 64
def stirling2(n):
S = [[0] * (n + 1) for _ in range(n + 1)]
S[0][0] = 1
for i in range(1, n + 1):
for j in range(1, i + 1):
S[i][j] = j * S[i - 1][j] + S[i - 1][j - 1]
return S[n]
def all_hit(m, draws):
return sum((-1) ** j * comb(m, j) * Fraction(G - j, G) ** draws
for j in range(m + 1))
def poly_mul(a, b):
out = [0] * (len(a) + len(b) - 1)
for i, x in enumerate(a):
for j, y in enumerate(b):
out[i + j] += x * y
return out
CHANNELS = ((1, 8), (2, 14), (3, 60), (4, 63), (5, 15), (6, 59), (7, 31),
(9, 52), (10, 20), (10, 34), (10, 57), (11, 56), (12, 22),
(13, 33), (16, 48), (17, 62), (18, 58), (19, 49), (20, 34),
(20, 57), (21, 45), (23, 43), (24, 61), (25, 51), (26, 44),
(27, 50), (28, 38), (29, 46), (30, 41), (32, 54), (34, 57),
(35, 36), (37, 40), (39, 55), (42, 53), (47, 64))
def report(DRAWS):
S = stirling2(DRAWS)
total = G ** DRAWS
occ = [Fraction(comb(G, j) * factorial(j) * S[j], total)
for j in range(DRAWS + 1)]
mean_d = sum(j * p for j, p in enumerate(occ))
sd = (sum(j * j * p for j, p in enumerate(occ)) - mean_d ** 2) ** 0.5
print(" {} draws: distinct gates E = {:.4f}, s.d. {:.4f}".format(
DRAWS, float(mean_d), float(sd)))
mode = max(range(DRAWS + 1), key=lambda j: occ[j])
print(" most likely {} gates (P = {:.4f})".format(
mode, float(occ[mode])))
ind = [1]
for poly in [[1, 4]] + [[1, 2]] * 30:
ind = poly_mul(ind, poly)
p0 = sum(Fraction(ind[j] * factorial(j) * S[j], total)
for j in range(min(len(ind), DRAWS + 1)))
if p0 < Fraction(1, 10000):
man, ex = "{:.3e}".format(float(p0)).split("e")
print(" P(no channel conducts) = {} x 10^{}".format(man, int(ex)))
else:
print(" P(no channel conducts) = {:.5f}".format(float(p0)))
mean_c = len(CHANNELS) * all_hit(2, DRAWS)
second = sum(all_hit(len(set(e) | set(f)), DRAWS)
for e in CHANNELS for f in CHANNELS)
print(" channels conducting: E[C] = {:.4f}, Var[C] = {:.4f}".format(
float(mean_c), float(second - mean_c ** 2)))
print(" P(a given channel conducts) = {:.5f}".format(
float(all_hit(2, DRAWS))))
if __name__ == "__main__":
print(" check: 64(1 - (63/64)^26) = {:.4f}".format(
64 * (1 - (63 / 64) ** 26)))
report(26)
report(52)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 5: Gate Activation and Channel Percolation in the Independence Model. 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 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
- Chapter 8 · Base Rates, the Information in Labels and Two Pre-Registered Studies