5D Library › Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation · 中文
Chapter 3. The Five-Part Oracle: Involutions and a Group Action on Signs and Tones
Four rules
Dreamspell assigns each kin four “oracle” positions, guide, analog, antipode and occult, which with the kin itself make the “fifth-force oracle” (Argüelles and Argüelles 1990). Writing the day sign as (the 20th sign as 0) and the tone as , the published rules are:
- analog: , the two signs summing to 19 modulo 20;
- antipode: , the signs differing by 10;
- occult: , signs summing to 21 and tones to 14;
- guide: a sign of the same colour, shifted according to the tone (second section).
Colour is : 1 red, 2 white, 3 blue, 0 yellow.
Calculation
# Chapter 3. p04: The Dreamspell oracle as a group action on Z20 x Z13.
# Seals 1..20 are taken mod 20 (seal 20 = 0), tones 1..13.
# analog A(s, t) = (19 - s, t) antipode P(s, t) = (s + 10, t)
# occult O(s, t) = (21 - s, 14 - t)
# Colour = s mod 4 (1 red, 2 white, 3 blue, 0 yellow). We check that A, P
# and O are involutions without fixed kins, find the group they generate
# on the seals, and how they act on the four colours.
from itertools import product
KINS = list(product(range(20), range(1, 14)))
def A(k):
return ((19 - k[0]) % 20, k[1])
def P(k):
return ((k[0] + 10) % 20, k[1])
def O(k):
return ((21 - k[0]) % 20, 14 - k[1])
def closure(gens):
ident = tuple(range(20))
group, frontier = {ident}, [ident]
while frontier:
g = frontier.pop()
for h in gens:
gh = tuple(h[g[i]] for i in range(20))
if gh not in group:
group.add(gh)
frontier.append(gh)
return group
if __name__ == "__main__":
for name, f in (("analog", A), ("antipode", P), ("occult", O)):
inv = all(f(f(k)) == k for k in KINS)
fixed = sum(f(k) == k for k in KINS)
print(" {:8s} involution {}, fixed kins {}".format(
name, inv, fixed))
tone_fixed = [t for t in range(1, 14) if 14 - t == t]
print(" occult fixes the tone only at t = {}".format(tone_fixed))
gens = [tuple(A((s, 1))[0] for s in range(20)),
tuple(P((s, 1))[0] for s in range(20)),
tuple(O((s, 1))[0] for s in range(20))]
G = closure(gens)
orbit = {g[1] for g in G}
print(" group generated on seals: order {}, orbit of seal 1: {}".format(
len(G), len(orbit)))
rot = tuple(A((O((s, 1))[0], 1))[0] for s in range(20))
order, cur = 1, list(rot)
while cur != list(range(20)):
cur = [rot[x] for x in cur]
order += 1
print(" A after O is the shift s -> s + {} (order {}); P = shift 10"
.format(rot[0], order))
short = {1: "R", 2: "W", 3: "B", 0: "Y"}
for name, f in (("analog", A), ("antipode", P), ("occult", O)):
same = all(f((s, 1))[0] % 4 == f((s % 4, 1))[0] % 4
for s in range(20))
m = " ".join("{}>{}".format(short[c], short[f((c, 1))[0] % 4])
for c in (1, 2, 3, 0))
print(" {:8s} on colours: {} (well defined: {})".format(
name, m, same))
ap = all(A(P((c, 1)))[0] % 4 == O((c, 1))[0] % 4 for c in range(4))
print(" on colours analog o antipode = occult: {} (Klein four-group)"
.format(ap))
# analog involution True, fixed kins 0
# antipode involution True, fixed kins 0
# occult involution True, fixed kins 0
# occult fixes the tone only at t = [7]
# group generated on seals: order 20, orbit of seal 1: 20
# A after O is the shift s -> s + 18 (order 10); P = shift 10
# analog on colours: R>W W>R B>Y Y>B (well defined: True)
# antipode on colours: R>B W>Y B>R Y>W (well defined: True)
# occult on colours: R>Y W>B B>W Y>R (well defined: True)
# on colours analog o antipode = occult: True (Klein four-group)Three involutions and the Klein four-group
The program checks that , and are involutions (applied twice they return to the start) and have not a single fixed point among the 260 kins. The reason is algebraic: and require to be odd, impossible in ; has no solution either. The occult keeps the tone only at tone 7 (), and even then the sign changes.
On the day signs the three maps generate a group of order 20, and the orbit of any sign is all 20 signs, so the action is regular: every “oracle relation” of a sign is fixed by a unique group element. and are two reflections, the composite is the shift (of order 10), and the antipode is exactly its fifth power, the shift by 10: the structure of the dihedral group of order 20.
On the colours each of the three maps is an involution without a fixed point: the analog swaps red with white and blue with yellow; the antipode red with blue and white with yellow; the occult red with yellow and white with blue; and “analog after antipode” equals “occult”. Together with the identity they form the Klein four-group acting regularly on the four colours. The complementary “colour families” of Dreamspell are this one four-group.
The guide is an affine map
The published guide table has five classes of tone: for tones 1, 6 and 11 the guide is the kin’s own sign; for 2, 7 and 12 add 12; for 3, 8 and 13 add 4; for 4 and 9 subtract 4; for 5 and 10 subtract 12.
Calculation
# Chapter 3. p05: The guide as an affine map, and oracle ties between two
# people. Published guide table: tones 1, 6, 11 -> same seal; 2, 7, 12 ->
# +12; 3, 8, 13 -> +4; 4, 9 -> -4; 5, 10 -> -12 (seals mod 20). We check
# that this is the single rule G(s, t) = (s + 12 (t - 1) mod 20, t).
# Then, for two kins drawn independently and uniformly, how often is the
# second one of the first one's four oracle kins?
from itertools import product
TABLE = {1: 0, 6: 0, 11: 0, 2: 12, 7: 12, 12: 12, 3: 4, 8: 4, 13: 4,
4: -4, 9: -4, 5: -12, 10: -12}
KINS = list(product(range(20), range(1, 14)))
def guide(k):
return ((k[0] + 12 * (k[1] - 1)) % 20, k[1])
def oracle(k):
s, t = k
return {"guide": guide(k), "analog": ((19 - s) % 20, t),
"antipode": ((s + 10) % 20, t), "occult": ((21 - s) % 20, 14 - t)}
if __name__ == "__main__":
ok = all((s + TABLE[t]) % 20 == guide((s, t))[0] for s, t in KINS)
print(" table = s + 12(t - 1) mod 20 for all 260 kins: {}".format(ok))
selfg = sum(guide(k) == k for k in KINS)
print(" kins that are their own guide: {} ({:.4f})".format(
selfg, selfg / 260))
same_colour = all(guide(k)[0] % 4 == k[0] % 4 for k in KINS)
print(" guide keeps the colour: {}".format(same_colour))
sizes = {}
for k in KINS:
n, cur = 1, guide(k)
while cur != k:
cur, n = guide(cur), n + 1
sizes[n] = sizes.get(n, 0) + 1
print(" iterating the guide, cycle length: kins {}".format(
dict(sorted(sizes.items()))))
hits = {"guide": 0, "analog": 0, "antipode": 0, "occult": 0}
any_tie = 0
for a, b in product(KINS, KINS):
if a == b:
continue
o = oracle(a)
tie = False
for key, v in o.items():
if v == b:
hits[key] += 1
tie = True
any_tie += tie
tot = 260 * 259
for key, v in hits.items():
print(" P(other is my {:8s}) = {:.5f}".format(key, v / tot))
print(" P(other is in my oracle at all) = {:.5f}".format(any_tie / tot))
print(" 12 people: expected ordered oracle ties {:.2f}".format(
12 * 11 * any_tie / tot))
# table = s + 12(t - 1) mod 20 for all 260 kins: True
# kins that are their own guide: 60 (0.2308)
# guide keeps the colour: True
# iterating the guide, cycle length: kins {1: 60, 5: 200}
# P(other is my guide ) = 0.00297
# P(other is my analog ) = 0.00386
# P(other is my antipode) = 0.00386
# P(other is my occult ) = 0.00386
# P(other is in my oracle at all) = 0.01455
# 12 people: expected ordered oracle ties 1.92The program proves that the table is equivalent to a single formula:
Because the shift depends only on ; because 12 is a multiple of 4, the guide always has the kin’s own colour. The 60 kins with tones 1, 6 and 11 (0.2308) are their own guide; for the other 200 kins, taking the guide repeatedly runs round cycles of length 5.
The base rate of oracle ties between two people
If two people’s kins are independent and uniform, one is the other’s analog, antipode or occult with probability 0.00386 each and their guide with probability 0.00297; one falls in one of the other’s four oracle positions with total probability 0.01455. In a group of 12 people, counting ordered pairs, 1.92 such ties are expected. “Finding” an oracle tie in any group of moderate size is all but certain.
Hypothesis · not established
The author’s hypothesis (not yet tested): reports of “a special affinity with an oracle partner” occur at a frequency proportional to group size, as the base rate predicts, and independently of whether the two people are actually linked by the oracle. What would show it wrong: if, under blind conditions (neither knowing the other’s kin), oracle-linked pairs report affinity significantly more often than unlinked pairs, the hypothesis fails. Chapter 8 gives the sample size.
Summary
Analog, antipode and occult are involutions without fixed points on ; on the signs they generate the dihedral group of order 20, acting regularly, and on the colours the Klein four-group; the guide is the affine map . Two random people are linked by the oracle with probability 0.01455.
References
Fan, Y. (2026). Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation: Coprime Cycle Synchronization, Antipode-Analog Permutations and Nine-Center Connected Components [玛雅卓尔金双模齿轮、神谕十字对合变换与六十四闸门网络渗流] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090193 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).