5D Library › 玛雅卓尔金双模齿轮、神谕十字对合变换与六十四闸门网络渗流 · English
第四章 六十四闸门轮、通道与中心
闸门轮就是邵雍的先天圆图
人类图把黄道分成 64 个「闸门」,每个闸门 5.625 度,以《易经》卦的文王序号命名;每个闸门再分为 6 条「爻线」,每条 0.9375 度。闸门轮从 302 度(宝瓶座 2 度)的第 41 门开始 (Hu and Bunnell 2011)。这个看似任意的次序,其实可以从卦的二进制结构生成。
把卦的六爻按「初爻为最高位、阳为 1」写成六位二进制数,邵雍的先天次序从 63(乾)排到 0(坤);先天圆图把前一半(63 到 32)放在圆的一侧,后一半(0 到 31)放在另一侧,首尾相接 (Swetz 2003)。程序用八卦上下组合的文王序号表把每个二进制数换成卦序,再沿圆图走一周。
推导
# Chapter 4. p06: The 64-gate wheel is the Shao Yong (Fu Xi) circle.
# King Wen number of a hexagram from its lower and upper trigram (table
# below; trigrams as 3-bit numbers, bottom line = most significant bit,
# yang = 1). Shao Yong's order lists hexagrams by the 6-bit number with
# line 1 as the top bit, from 63 (qian) down to 0 (kun); his circle runs
# 63 ... 32 on one side and 0 ... 31 on the other. The Human Design wheel
# starts gate 41 at 302 degrees (2 Aquarius); each gate spans 5.625 deg.
# trigram values, bottom line first: qian 111, dui 110, li 101, zhen 100,
# xun 011, kan 010, gen 001, kun 000; table columns follow ORDER
ORDER = (7, 4, 2, 1, 0, 3, 5, 6) # qian zhen kan gen kun xun li dui
KW = ((1, 34, 5, 26, 11, 9, 14, 43), (25, 51, 3, 27, 24, 42, 21, 17),
(6, 40, 29, 4, 7, 59, 64, 47), (33, 62, 39, 52, 15, 53, 56, 31),
(12, 16, 8, 23, 2, 20, 35, 45), (44, 32, 48, 18, 46, 57, 50, 28),
(13, 55, 63, 22, 36, 37, 30, 49), (10, 54, 60, 41, 19, 61, 38, 58))
HD = (41, 19, 13, 49, 30, 55, 37, 63, 22, 36, 25, 17, 21, 51, 42, 3, 27,
24, 2, 23, 8, 20, 16, 35, 45, 12, 15, 52, 39, 53, 62, 56, 31, 33, 7,
4, 29, 59, 40, 64, 47, 6, 46, 18, 48, 57, 32, 50, 28, 44, 1, 43, 14,
34, 9, 5, 26, 11, 10, 58, 38, 54, 61, 60)
def king_wen(v):
lower, upper = v >> 3, v & 7
return KW[ORDER.index(lower)][ORDER.index(upper)]
def dms(x):
sign = "Ari Tau Gem Can Leo Vir Lib Sco Sag Cap Aqu Pis".split()
x %= 360
d = int(x % 30)
m = round((x % 30 - d) * 60, 1)
return "{:2d}{}{:04.1f}'".format(d, sign[int(x // 30)], m)
if __name__ == "__main__":
shao = [king_wen(v) for v in range(63, -1, -1)]
print(" King Wen table is a permutation of 1..64: {}".format(
sorted(shao) == list(range(1, 65))))
circle = shao[:32] + shao[32:][::-1] # walk round the circle
k = circle.index(41)
walk = tuple(circle[k:] + circle[:k])
print(" HD wheel = Shao Yong circle read from gate 41: {}".format(
walk == HD))
print(" Shao Yong position of gate 41: {} (binary {:06b})".format(
shao.index(41), 63 - shao.index(41)))
W = 360 / 64
print(" gate width {} deg, line width {} deg".format(W, W / 6))
for g in (41, 60, 25, 17, 27, 2, 1):
print(" gate {:2d} starts at {:7.3f} deg = {}".format(
g, (302 + HD.index(g) * W) % 360, dms(302 + HD.index(g) * W)))
print(" wheel by rows of 16:")
for r in range(4):
print(" " + " ".join("{:2d}".format(g) for g in HD[16 * r:
16 * r + 16]))
# King Wen table is a permutation of 1..64: True
# HD wheel = Shao Yong circle read from gate 41: True
# Shao Yong position of gate 41: 14 (binary 110001)
# gate width 5.625 deg, line width 0.9375 deg
# gate 41 starts at 302.000 deg = 2Aqu00.0'
# gate 60 starts at 296.375 deg = 26Cap22.5'
# gate 25 starts at 358.250 deg = 28Pis15.0'
# gate 17 starts at 3.875 deg = 3Ari52.5'
# gate 27 starts at 32.000 deg = 2Tau00.0'
# gate 2 starts at 43.250 deg = 13Tau15.0'
# gate 1 starts at 223.250 deg = 13Sco15.0'
# wheel by rows of 16:
# 41 19 13 49 30 55 37 63 22 36 25 17 21 51 42 3
# 27 24 2 23 8 20 16 35 45 12 15 52 39 53 62 56
# 31 33 7 4 29 59 40 64 47 6 46 18 48 57 32 50
# 28 44 1 43 14 34 9 5 26 11 10 58 38 54 61 60结果是:从第 41 卦(二进制 110001,在邵雍次序中的位置编号为 14,从 0 起算)起沿先天圆图读出的 64 个卦序,与人类图的闸门轮逐一相同。程序还给出若干闸门的起点:第 41 门 302 度,第 25 门 358.250 度(双鱼座 28 度 15 分),第 17 门 3.875 度,第 2 门 43.250 度,第 1 门 223.250 度。
证据
结论:闸门轮的次序是先天圆图,不是一个新的排列。 人类图在这个圆上额外选定了起点(第 41 卦)与方向,并把它固定在回归黄道上。第七章回到先天图与莱布尼茨的二进制。
通道与中心
每个闸门属于九个中心之一:头顶、阿吉那、喉咙、G、意志力(Heart)、直觉(Spleen)、情绪(Solar Plexus,程序中写作 SolarPl)、荐骨(Sacral)与根部(Root)。36 条「通道」各连接两个闸门。
推导
# Chapter 4. p07: 64 gates, 36 channels, 9 centres - the graph.
# Each gate belongs to one centre; a channel joins two gates in different
# centres. We check the counts, find the components of the gate graph
# and count channels between each pair of centres.
CENTRES = {
"Head": (64, 61, 63), "Ajna": (47, 24, 4, 17, 43, 11),
"Throat": (62, 23, 56, 35, 12, 45, 33, 8, 31, 20, 16),
"G": (1, 13, 25, 46, 2, 15, 10, 7), "Heart": (21, 40, 26, 51),
"Spleen": (48, 57, 44, 50, 32, 28, 18),
"SolarPl": (6, 37, 22, 36, 30, 55, 49),
"Sacral": (5, 14, 29, 59, 9, 3, 42, 27, 34),
"Root": (53, 60, 52, 19, 39, 41, 58, 38, 54)}
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))
HOME = {g: c for c, gs in CENTRES.items() for g in gs}
def components(nodes, edges):
parent = {v: v for v in nodes}
def find(v):
while parent[v] != v:
parent[v] = parent[parent[v]]
v = parent[v]
return v
for a, b in edges:
parent[find(a)] = find(b)
groups = {}
for v in nodes:
groups.setdefault(find(v), []).append(v)
return list(groups.values())
if __name__ == "__main__":
print(" gates {} (all of 1..64: {}), channels {}, centres {}".format(
len(HOME), sorted(HOME) == list(range(1, 65)), len(CHANNELS),
len(CENTRES)))
deg = {g: 0 for g in HOME}
for a, b in CHANNELS:
deg[a] += 1
deg[b] += 1
print(" every gate in a channel: {}; gates in 3 channels: {}".format(
min(deg.values()) >= 1, sorted(g for g in deg if deg[g] == 3)))
print(" channels inside one centre: {}".format(
sum(HOME[a] == HOME[b] for a, b in CHANNELS)))
comp = components(list(HOME), CHANNELS)
sizes = sorted(len(c) for c in comp)
print(" gate-graph components: {} pairs + {}".format(
sizes.count(2), [s for s in sizes if s > 2]))
pair = {}
for a, b in CHANNELS:
key = tuple(sorted((HOME[a], HOME[b])))
pair[key] = pair.get(key, 0) + 1
print(" centre pairs joined: {} of 36 possible".format(len(pair)))
for key in sorted(pair, key=lambda k: (-pair[k], k)):
print(" {:8s} - {:8s} {}".format(key[0], key[1], pair[key]))
cdeg = {c: 0 for c in CENTRES}
for (a, b), n in pair.items():
cdeg[a] += n
cdeg[b] += n
names = list(CENTRES)
print(" channels per centre: " + ", ".join(
"{} {}".format(c, cdeg[c]) for c in names[:5]))
print(" " + ", ".join(
"{} {}".format(c, cdeg[c]) for c in names[5:]))
# gates 64 (all of 1..64: True), channels 36, centres 9
# every gate in a channel: True; gates in 3 channels: [10, 20, 34, 57]
# channels inside one centre: 0
# gate-graph components: 30 pairs + [4]
# centre pairs joined: 17 of 36 possible
# G - Sacral 4
# G - Throat 4
# Ajna - Head 3
# Ajna - Throat 3
# Root - Sacral 3
# Root - SolarPl 3
# Root - Spleen 3
# Sacral - Spleen 2
# SolarPl - Throat 2
# Spleen - Throat 2
# G - Heart 1
# G - Spleen 1
# Heart - SolarPl 1
# Heart - Spleen 1
# Heart - Throat 1
# Sacral - SolarPl 1
# Sacral - Throat 1
# channels per centre: Head 3, Ajna 6, Throat 13, G 10, Heart 4
# Spleen 9, SolarPl 7, Sacral 11, Root 9程序核对了结构:64 个闸门各属一个中心,36 条通道都连接不同中心的闸门,每个闸门至少在一条通道中。闸门 10、20、34、57 各在三条通道中,四者两两相连,构成一个完全图 ;其余 60 个闸门恰好两两配成 30 条互不相交的通道。所以在闸门层面,整张图就是「一个 加 30 条孤立的边」,这使第五章的精确计算成为可能。
在中心层面,36 条通道只连接了 36 个中心对中的 17 个;G 与荐骨、G 与喉咙之间各有 4 条通道,是最粗的连接。喉咙中心涉及 13 条通道,荐骨 11 条,G 10 条,头顶只有 3 条,意志力 4 条。
小结
64 闸门轮是邵雍先天圆图从第 41 卦起的读法。通道图在闸门层面是一个 加 30 条孤立边;在中心层面是 9 个顶点、17 对相连的多重图,喉咙中心的度最大。
参考文献
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).