What does Human Design, Tzolkin and Tarot Projection conclude, in numbers, about “Twenty Seals and Thirteen Tones: One Table, Two Ways of Counting”?

Answer: Because they are coprime, twenty day names and thirteen numbers combine into 260 kins; each seal opens one thirteen-day wave and gains 7 in its number at every return. The Dreamspell stops on 29 February and so drifts ever further from the traditional highland count: between 1900 and 2099 the two give the same seal on only 2922 days, all within two four-year windows in the early 1960s and the early 2040s, and the same kin on not a single day. The four oracle positions are additions and subtractions mod 20; they come from the Dreamspell and do not belong to the traditional count. Each of the twenty seals and thirteen numbers is read with a gift, a shadow and one decision rule that can be carried out; whether they hold for a given person is for the three-way blind test at the end to answer.

Scope of the numbers: All calculations are generated by the book's programs; it is not investment, legal, medical or psychological advice. Marked boxes separate published evidence, runnable Python calculations, 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: 1900, 1960, 2040, 2099, 260, 2922

check 2013-12-24 Dreamspell55 traditional 8
check 2012-12-21 Dreamspell 207 traditional 160
offset Dreamspell - traditional (mod 260) on 1 January:
190075 1950 63 1980 56 2000 51 2026 44 2050 38 2099 26
days 1900-209973049
same seal2922 days (0.0400) same tone: 5785 days (0.0792) same kin: 0
same-seal window 1960-02-29 to 1964-02-28 (1461 days)
same-seal window 2040-02-29 to 2044-02-28 (1461 days)
years with a same-tone day1940-1944, 1992-1996, 2044-2048, 2096-2099
share of days whose two seals differ0.9600
Show the full program
# Chapter 4. p21: How often the Dreamspell and the traditional count disagree.
# Traditional (GMT 584283): kin = (JDN - 584283 + 159) mod 260 + 1, a count
# that never skips. Dreamspell: anchored at kin 164 on 26 July 2013, it does
# not advance on 29 February (that day repeats the kin of 28 February).
# The offset (Dreamspell - traditional) mod 260 therefore drops by one at
# every leap day. Seals agree when the offset is 0 mod 20, tones agree when
# it is 0 mod 13, whole kins agree only at offset 0. We walk every day from
# 1 Jan 1900 to 31 Dec 2099 and count.
import datetime as dt

GMT = 584283
ANCHOR = dt.date(2013, 7, 26)


def gmt_kin(d):
    j = d.toordinal() + 1721425          # proleptic Gregorian -> JDN
    return (j - GMT + 159) % 260 + 1


def leap_days_between(lo, hi):
    n = 0
    for y in range(lo.year, hi.year + 1):
        if y % 4 == 0 and (y % 100 != 0 or y % 400 == 0):
            n += lo < dt.date(y, 2, 29) < hi
    return n


def ds_kin(d):
    if (d.month, d.day) == (2, 29):
        d = dt.date(d.year, 2, 28)
    days = (d - ANCHOR).days
    skip = leap_days_between(min(d, ANCHOR), max(d, ANCHOR))
    days = days - skip if days > 0 else days + skip
    return (163 + days) % 260 + 1


def parts(k):
    return (k - 1) % 13 + 1, (k - 1) % 20 + 1


def runs(years):
    out, ys = [], sorted(years)
    for y in ys:
        if out and y == out[-1][1] + 1:
            out[-1][1] = y
        else:
            out.append([y, y])
    return ", ".join("{}-{}".format(a, b) for a, b in out)


def main():
    for d in (dt.date(2013, 12, 24), dt.date(2012, 12, 21)):
        print("   check {}  Dreamspell {:3d}  traditional {:3d}".format(d, ds_kin(d), gmt_kin(d)))
    print("   offset Dreamspell - traditional (mod 260) on 1 January:")
    print("   " + "  ".join("{} {:3d}".format(y, (ds_kin(dt.date(y, 1, 1)) - gmt_kin(dt.date(y, 1, 1))) % 260)
                            for y in (1900, 1950, 1980, 2000, 2026, 2050, 2099)))
    n = seal = tone = both = 0
    tone_years, seal_days = set(), []
    d, b = dt.date(1900, 1, 1), dt.date(2099, 12, 31)
    while d <= b:
        t1, s1 = parts(ds_kin(d))
        t2, s2 = parts(gmt_kin(d))
        n += 1
        seal += s1 == s2
        tone += t1 == t2
        both += (t1, s1) == (t2, s2)
        if s1 == s2:
            seal_days.append(d)
        if t1 == t2:
            tone_years.add(d.year)
        d += dt.timedelta(1)
    print("   days 1900-2099: {}".format(n))
    print("   same seal: {} days ({:.4f})  same tone: {} days ({:.4f})  same kin: {}".format(
        seal, seal / n, tone, tone / n, both))
    cuts = [0] + [i for i in range(1, len(seal_days)) if (seal_days[i] - seal_days[i - 1]).days > 1]
    for c, e in zip(cuts, cuts[1:] + [len(seal_days)]):
        print("     same-seal window {} to {} ({} days)".format(seal_days[c], seal_days[e - 1], e - c))
    print("   years with a same-tone day: {}".format(runs(tone_years)))
    print("   share of days whose two seals differ: {:.4f}".format(1 - seal / n))


if __name__ == "__main__":
    main()

Single source and citation

Fan, Y. (2026). The Human Design, Tzolkin and Seventy-Eight Tarot Projection Codex (Version 1.0.0), Chapter 4: Twenty Seals and Thirteen Tones: One Table, Two Ways of Counting. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-126 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026126,
  author    = {Fan, Yafu},
  title     = {The Human Design, Tzolkin and Seventy-Eight Tarot Projection Codex},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book