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

Chapter 8. Base Rates, the Information in Labels and Two Pre-Registered Studies

Base rates of coincidence

Calculation

# Chapter 8. p15: Base rates and information in the labels.
# (1) Coincidences: in a group of n, the chance that two people share a
#     kin (260 equally likely), a colour (4), a type (simulated shares).
# (2) Information: the entropy in bits of each label - kin, colour, type,
#     profile - i.e. how finely a label can sort people at all.
import importlib.util
import random
from math import log2, prod

def load(name):
    spec = importlib.util.spec_from_file_location(name, name + ".py")
    m = importlib.util.module_from_spec(spec)
    spec.loader.exec_module(m)
    return m

pop = load("p11_population_model")
rules = load("p09_centres_types")

def share_uniform(n, k):
    return 1 - prod((k - i) / k for i in range(n)) if n <= k else 1.0

def entropy(ps):
    return -sum(p * log2(p) for p in ps if p > 0)

if __name__ == "__main__":
    rng = random.Random(72015)
    N, kinds = 10000, {}
    for _ in range(N):
        k = rules.analyse(set(pop.chart(rng.uniform(2433282.5,
                                                    2462502.5))))[3]
        kinds[k] = kinds.get(k, 0) + 1
    tshare = [v / N for v in kinds.values()]
    same_type = sum(p * p for p in tshare)
    print("   two strangers share: kin {:.4f}, colour {:.4f}, type {:.4f}"
          .format(1 / 260, 1 / 4, same_type))
    for n in (5, 10, 20, 30):
        print("   group of {:2d}: some pair shares a kin {:.3f}".format(
            n, share_uniform(n, 260)))
    n50 = next(n for n in range(2, 100) if share_uniform(n, 260) >= 0.5)
    print("   smallest group with an even chance of a shared kin: {}".format(
        n50))
    prof = [0.8667 / 6] * 6 + [0.1333 / 6] * 6
    print("   entropy, bits: kin {:.2f}, colour {:.2f}, type {:.2f},"
          " profile {:.2f}".format(log2(260), log2(4), entropy(tshare),
                                   entropy(prof)))
#    two strangers share: kin 0.0038, colour 0.2500, type 0.2855
#    group of  5: some pair shares a kin 0.038
#    group of 10: some pair shares a kin 0.161
#    group of 20: some pair shares a kin 0.528
#    group of 30: some pair shares a kin 0.825
#    smallest group with an even chance of a shared kin: 20
#    entropy, bits: kin 8.02, colour 2.00, type 1.92, profile 3.15

Two strangers share a kin with probability 0.0038, a colour with probability 0.2500, and a Human Design type with probability 0.2855 (using the type shares of Chapter 6). In a group of 20 the chance that two people share a kin is already above one half (0.528); with 30 it is 0.825. Discoveries such as “we have the same signature” or “we are both Generators” are all but certain in any group of moderate size.

How finely a label sorts

How finely a label can sort people is measured by its entropy. A kin carries 8.02 bits, a colour 2.00 bits, a Human Design type 1.92 bits and a profile 3.15 bits (less than log⁡212\log_2 12 because the 12 profiles are not equally likely). A label of under 2 bits such as type can only sort people into about four classes, each holding about a quarter or more of everyone. For a description that covers a quarter of the population, the coverage model of Chapter 6 of Volume 71 shows that it will be accepted by almost anyone: this is the Barnum effect in the form of type descriptions (Forer 1949; Dickson and Kelly 1985).

Note

A four-step check. First, state which count is used (traditional GMT 584283 or Dreamspell, see p03), which ephemeris and which algorithm for the design moment. Second, check the precision of the birth time: an hour’s error changes the Moon’s line (Chapter 6). Third, compute the base rate first: compare any “coincidence” or “rare type” with the base rates of this chapter and of Chapters 5 and 6. Fourth, replace “is this like me?” by blind recognition.

Study A: blind recognition

Each participant receives four descriptions of “type and profile” with labels removed, one written from their own chart and three from strangers’ charts (chosen in advance to differ from the participant’s type), and picks the one most like them. The chance hit rate is 1/4.

Calculation

# 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)))
#    (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

If the true hit rate is 0.32, an exact one-sided binomial test at 0.05 with power 0.90 needs 359 participants and at least 104 hits, with an actual type I error of 0.0485; if the true hit rate is 0.35, it needs 179 participants and at least 55 hits. The descriptions should be written from the charts by writers who do not know who the participants are, with sentences that would fit anyone removed.

Study B: oracle ties and couples

Chapter 3 found that a couple is linked by the oracle in either direction (analog, antipode, occult or guide) with probability 0.01752. To obtain 150 linked couples, about 8561 couples must be recruited. The outcome measure (a relationship satisfaction scale, say) and the analysis plan must be registered before anyone’s kin is known, comparing linked with unlinked couples.

Hypothesis · not established

Pre-registered predictions (not yet tested): in Study A the hit rate does not differ significantly from 0.25; in Study B linked and unlinked couples do not differ significantly on the pre-specified outcome. What would show them wrong: a hit rate in Study A significantly above 0.25, or a significant difference between the two groups of Study B on the pre-specified outcome.

Summary of the book

The tzolkin is the product of two coprime gears, and the Calendar Round and year bearers are fixed by congruence arithmetic; Dreamspell is a different count that never coincides with the traditional one. The fifth-force oracle is a group action on ℤ20×ℤ13\mathbb{Z}_{20} \times \mathbb{Z}_{13}, the Klein four-group on the colours, with an affine guide. The Human Design gate wheel is Shao Yong’s Xiantian circle; in the real sky Reflectors make up about 0.0084 (p11), and the uneven probabilities of the twelve profiles come from the single constant of 88 degrees. Every conclusion comes from the structure of the systems themselves and involves no claim that any signature or type comes true.

References

Dickson, D. H., and I. W. Kelly. 1985. “The ‘Barnum Effect’ in Personality Assessment: A Review of the Literature.” Psychological Reports 57 (2): 367–82.
Forer, Bertram R. 1949. “The Fallacy of Personal Validation: A Classroom Demonstration of Gullibility.” The Journal of Abnormal and Social Psychology 44 (1): 118–23.

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