5D Library › Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation · 中文

Chapter 7. The Venus Table of the Dresden Codex and the Xiantian Circle

Why read these sources here

The Calendar Round of Chapter 1 and the gate wheel of Chapter 4 both have old sources. The Dresden Codex is one of the four surviving Maya codices, and its Venus table and many 260-day almanacs carry the congruence arithmetic of Chapter 1 to larger periods (Thompson 1972; Bricker and Bricker 2011). The Xiantian circle behind the gate wheel comes from Shao Yong of the Northern Song; early in the eighteenth century it reached Leibniz through the Jesuit Joachim Bouvet in China, and Leibniz read it as binary numbers (Swetz 2003; Leibniz 1703). This chapter checks the parts of both that can be written as counts.

The arithmetic of the Venus table

Evidence

Verified: the Venus table on page 24 and pages 46 to 50 of the Dresden Codex takes 584 days as one synodic period and divides it into four stretches of 236, 90, 250 and 8 days (morning star, invisible, evening star, invisible); five periods make one row, and the table’s 13 rows return to the tzolkin day they started from (Thompson 1972; Aveni 2001).

Calculation

# Chapter 7. p13: The arithmetic of the Dresden Codex Venus table.
# The table runs 5 Venus synodic periods of 584 days (canonical 236, 90,
# 250 and 8 days: morning star, invisible, evening star, invisible), and
# is laid out with 13 lines so that it closes on the tzolkin. We check
# the coincidences it rests on, and the error of 584 against the mean
# synodic period of Venus (583.92 days).
from math import gcd

def lcm(*xs):
    out = 1
    for x in xs:
        out = out * x // gcd(out, x)
    return out

if __name__ == "__main__":
    parts = (236, 90, 250, 8)
    print("   phases {} sum to {}".format(parts, sum(parts)))
    print("   5 x 584 = {} = 8 x 365 = {}".format(5 * 584, 8 * 365))
    print("   lcm(584, 260) = {} = {} Venus periods = {} tzolkin".format(
        lcm(584, 260), lcm(584, 260) // 584, lcm(584, 260) // 260))
    print("   13 x 2920 = {} = 146 x 260 = {}".format(13 * 2920, 146 * 260))
    big = lcm(584, 365, 260)
    print("   lcm(584, 365, 260) = {} = {} Calendar Rounds = {} haab".format(
        big, big // 18980, big // 365))
    print("   = {} Venus periods = {} tzolkin".format(big // 584,
                                                       big // 260))
    drift = 584 - 583.92
    print("   error of 584 days: {:.2f} day per period, {:.1f} days over"
          " 65 periods".format(drift, 65 * drift))
#    phases (236, 90, 250, 8) sum to 584
#    5 x 584 = 2920 = 8 x 365 = 2920
#    lcm(584, 260) = 37960 = 65 Venus periods = 146 tzolkin
#    13 x 2920 = 37960 = 146 x 260 = 37960
#    lcm(584, 365, 260) = 37960 = 2 Calendar Rounds = 104 haab
#    = 65 Venus periods = 146 tzolkin
#    error of 584 days: 0.08 day per period, 5.2 days over 65 periods

The four stretches sum to 584; five synodic periods, 5×584=29205 \times 584 = 2920 days, are exactly eight haab years, 8×3658 \times 365. The table has 13 rows so that its total length 13×2920=3796013 \times 2920 = 37960 days is also 146 tzolkin cycles: 37960 is the least common multiple of 584 and 260, that is 65 Venus periods. It is a multiple of 365 as well: 37960 is the least common multiple of 584, 365 and 260, two Calendar Rounds or 104 haab years. All three periods close here at once.

584 days is 0.08 day longer than the mean synodic period of Venus, 583.92 days, which accumulates to 5.2 days over 65 periods. The codex contains correction schemes for this accumulated error (Aveni 2001); the book does not go into their details, and notes only that their existence shows the compilers knew 584 to be a rounded value.

The Xiantian circle and binary numbers

Source text

The title of Leibniz’s paper of 1703

Explication de l’Arithmétique Binaire, qui se sert des seuls caractères 0 & 1 … et sur ce qu’elle donne le sens des anciennes figures Chinoises de Fohy

(Leibniz 1703)

The “ancient Chinese figures of Fuxi” of the title are Shao Yong’s Xiantian square and circle. Chapter 4 showed that the Human Design gate wheel is this circle read from hexagram 41.

Calculation

# Chapter 7. p14: Shao Yong's circle, Leibniz's binary numbers and the
# "mandala" read as positions. Leibniz (1703) saw that Shao Yong's square
# and circle list the hexagrams as the binary numbers 0..63. We list the
# circle's two half-circles, show that each step changes the number by 1
# (except at the two joins), and count how many neighbouring gates on the
# 64-gate wheel differ in exactly one line.
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))
ORDER = (7, 4, 2, 1, 0, 3, 5, 6)

def king_wen(v):
    return KW[ORDER.index(v >> 3)][ORDER.index(v & 7)]

if __name__ == "__main__":
    values = list(range(63, -1, -1))
    circle = values[:32] + values[32:][::-1]
    print("   first half (63 down to 32): King Wen " + " ".join(
        str(king_wen(v)) for v in circle[:8]) + " ...")
    print("   second half (0 up to 31):   King Wen " + " ".join(
        str(king_wen(v)) for v in circle[32:40]) + " ...")
    steps = [abs(circle[i] - circle[(i + 1) % 64]) for i in range(64)]
    print("   steps of size 1 round the circle: {} of 64; others: {}".format(
        steps.count(1), sorted(s for s in steps if s != 1)))
    flips = [bin(circle[i] ^ circle[(i + 1) % 64]).count("1")
             for i in range(64)]
    print("   neighbours differing in exactly one line: {} of 64".format(
        flips.count(1)))
    print("   lines changed between neighbours: {}".format(
        {k: flips.count(k) for k in sorted(set(flips))}))
    gray = [v ^ (v >> 1) for v in range(64)]
    print("   a Gray-code wheel would give 64 of 64: {}".format(
        all(bin(gray[i] ^ gray[(i + 1) % 64]).count("1") == 1
            for i in range(64))))
#    first half (63 down to 32): King Wen 1 43 14 34 9 5 26 11 ...
#    second half (0 up to 31):   King Wen 2 23 8 20 16 35 45 12 ...
#    steps of size 1 round the circle: 62 of 64; others: [32, 32]
#    neighbours differing in exactly one line: 34 of 64
#    lines changed between neighbours: {1: 34, 2: 16, 3: 8, 4: 4, 5: 2}
#    a Gray-code wheel would give 64 of 64: True

Walking once round the Xiantian circle, the binary numbers of neighbouring hexagrams differ by 1 in 62 of 64 steps, and by 32 only where the two half-circles meet. Yet neighbours differ in a single line in only 34 places; two lines change in 16, three in 8, four in 4 and five in 2, because adding one in binary often carries. Arranged as a Gray code, the 64 hexagrams would change one line at every step. The “continuity” of the Xiantian circle is thus continuity of number, not of the line figures; the gate wheel inherits the former.

Hypothesis · not established

The author’s reading (not yet tested): Human Design chose the Xiantian circle rather than the King Wen order or a Gray code because on the ecliptic the Xiantian circle unites “adjacent in number” with “adjacent in space”. What would show the reading wrong: if the system’s original documents state another source for the gate order, so that the agreement with the Xiantian circle is a coincidence, the reading fails.

Summary

The Venus table of the Dresden Codex closes the three periods 584, 365 and 260 together in 37960 days: 65 Venus periods, 104 haab years, 146 tzolkin cycles, two Calendar Rounds. The Xiantian circle is a continuous binary count round the circle, and neighbouring hexagrams differ in one line in only 34 places; the Human Design gate wheel inherits this numerical continuity.

References

Aveni, Anthony F. 2001. Skywatchers: A Revised and Updated Version of Skywatchers of Ancient Mexico. University of Texas Press.
Bricker, Harvey M., and Victoria R. Bricker. 2011. Astronomy in the Maya Codices. Vol. 265. Memoirs of the American Philosophical Society. American Philosophical Society.
Leibniz, Gottfried Wilhelm. 1703. “Explication de l’arithmétique Binaire.” Mémoires de l’Académie Royale Des Sciences, 85–89.
Swetz, Frank J. 2003. “Leibniz, the Yijing, and the Religious Conversion of the Chinese.” Mathematics Magazine 76 (4): 276–91.
Thompson, J. Eric S. 1972. A Commentary on the Dresden Codex: A Maya Hieroglyphic Book. Vol. 93. Memoirs of the American Philosophical Society. American Philosophical Society.

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).