5D Library › 黄历择吉布尔格、建除十二直同余与卢恩符文组合学 · English

第七章 睡虎地秦简《日书》、清代《协纪辨方书》与《埃达·高人的箴言》中的卢恩

为什么在这里读这些原典

本书的计算有三个历史锚点:建除最早的写本,一次由朝廷确定择日规则官方版本的尝试,以及奥丁取得卢恩的北欧诗篇。核对后要说明两点。第一,睡虎地《日书》已经并列抄有两套建除系统,所以流派之间的分歧与建除本身一样古老。第二,《高人的箴言》讲的是卢恩如何得来,并未说到抽取卢恩、倒置卢恩或把它当作签来读,所以第五、六章计算的那些约定都是现代的。

一部秦代写本中的两套系统

湖北云梦睡虎地十一号墓出土的竹简,下葬于公元前三世纪晚期,其中有两种供择日用的《日书》(睡虎地秦墓竹简整理小组 1990)。《日书》甲种开头的几支简上,有一篇只题为「除」的文字,一般读作楚式的「楚除」,其后是题为「秦除」的秦式系统 (Harkness 2019)。秦式系统是沿用至今的建除十二神的祖先;在汉代孔家坡写本中,标准的十二个名称是建、除、盈、平、定、执、破、危、成、收、开、闭,后世通书作「满」的位置写作「盈」,而《日书》甲种的「破」用的是另一个字 (Harkness 2019)。李家浩认为「楚除」是战国晚期的楚地形式,把建除系统与另一套「丛辰」系统结合在一起 (李家浩 1999)。一部《日书》为同一用途抄下两套系统而不作取舍,这是第一章所说「两个流派」现存最早的实例。

给规则排序

通书彼此不一致时,总得有人给规则排序。清廷在《钦定协纪辨方书》中做了这件事,这是乾隆年间由允禄等纂修的三十六卷官书,列入子部术数类 (允禄 et al. 乾隆年间)。下面的计算要问:这样的排序决定了多少。

推导

# Chapter 7. p14: When the verdict depends on the order of the rules.
# Ten kinds of mark: five good (tian de, yue de, tian she, good officer,
# yellow road) and five bad (bad officer, black road, year breaker,
# three sha, unlucky lodge). A school ranks the ten kinds; a day's
# verdict is the sign of its highest-ranked mark. Over all 10! = 3,628,800
# rankings, a day with g good and b bad marks is called good in g/(g+b)
# of them (each present mark is equally likely to rank first; checked by
# enumeration on one day). Counted for 2027: days whose verdict is fixed,
# and days that two rankings ("virtues first", "breakers first") split.
from itertools import permutations
import datetime

OFFICERS = ("jian chu man ping ding zhi po wei cheng shou kai bi").split()
# the 12 "jie" of 2027, Beijing time (UTC+8), from NAOJ's 2027 table
JIE = ((1, 5, 22, 10), (2, 4, 9, 46), (3, 6, 3, 40), (4, 5, 8, 17),
       (5, 6, 1, 25), (6, 6, 5, 26), (7, 7, 15, 37), (8, 8, 1, 27),
       (9, 8, 4, 28), (10, 8, 20, 17), (11, 7, 23, 39), (12, 7, 16, 38))
D0 = datetime.date(2027, 1, 1)          # geng-chen day, mansion Gui (22)

def days(offset_h=0):
    """One dict per day of 2027: stem, branch, month and year branch."""
    jie = [datetime.datetime(2027, m, d, h, mi) +
           datetime.timedelta(hours=offset_h) for m, d, h, mi in JIE]
    out = []
    for k in range(365):
        day = D0 + datetime.timedelta(days=k)
        n = sum(1 for j in jie if j.date() <= day)   # jie passed
        gz = (16 + k) % 60
        out.append({"date": day, "gz": gz, "s": gz % 10, "b": gz % 12,
                    "M": n % 12, "Y": 6 if n < 2 else 7,
                    "mansion": (22 + k) % 28})
    return out

GOOD_OFFICER = {1, 4, 5, 7, 8, 10}     # chu ding zhi wei cheng kai
QINGLONG = {2: 0, 8: 0, 3: 2, 9: 2, 4: 4, 10: 4, 5: 6, 11: 6,
            0: 8, 6: 8, 1: 10, 7: 10}  # month branch -> Azure Dragon day
YELLOW = {0, 1, 4, 5, 7, 10}           # the six "yellow road" gods
SANSHA = {8: (5, 6, 7), 0: (5, 6, 7), 4: (5, 6, 7),
          2: (11, 0, 1), 6: (11, 0, 1), 10: (11, 0, 1),
          5: (2, 3, 4), 9: (2, 3, 4), 1: (2, 3, 4),
          11: (8, 9, 10), 3: (8, 9, 10), 7: (8, 9, 10)}
BAD_MANSION = {1, 2, 4, 8, 9, 10, 11, 14, 17, 19, 22, 23, 26}  # model
TIANDE = {2: ("s", 3), 3: ("b", 8), 4: ("s", 8), 5: ("s", 7),
          6: ("b", 11), 7: ("s", 0), 8: ("s", 9), 9: ("b", 2),
          10: ("s", 2), 11: ("s", 1), 0: ("b", 5), 1: ("s", 6)}
YUEDE = {2: 2, 6: 2, 10: 2, 8: 8, 0: 8, 4: 8, 11: 0, 3: 0, 7: 0,
         5: 6, 9: 6, 1: 6}
TIANSHE = {2: 14, 3: 14, 4: 14, 5: 30, 6: 30, 7: 30,
           8: 44, 9: 44, 10: 44, 11: 0, 0: 0, 1: 0}

def officer(d):
    return (d["b"] - d["M"]) % 12

def marks(d, births=(0, 3)):
    """Bad marks (rule sets R1..R7) and good marks of one day."""
    bad = {
        "R1 officer": officer(d) not in GOOD_OFFICER,
        "R2 black road": (d["b"] - QINGLONG[d["M"]]) % 12 not in YELLOW,
        "R3 year breaker": d["b"] == (d["Y"] + 6) % 12,
        "R4 three sha": d["b"] in SANSHA[d["M"]],
        "R5 mansion": d["mansion"] in BAD_MANSION,
        "R6 clash A": d["b"] == (births[0] + 6) % 12,
        "R7 clash B": d["b"] == (births[1] + 6) % 12,
    }
    kind, v = TIANDE[d["M"]]
    good = {
        "tian de": d[kind] == v,
        "yue de": d["s"] == YUEDE[d["M"]],
        "tian she": d["gz"] == TIANSHE[d["M"]],
    }
    return bad, good

def day_marks(d):
    bad, good = marks(d)
    g = [k for k, v in good.items() if v]
    g += ["good officer"] if not bad["R1 officer"] else []
    g += ["yellow road"] if not bad["R2 black road"] else []
    b = [k for k, v in bad.items() if v and k[:2] in
         ("R1", "R2", "R3", "R4", "R5")]
    return g, b

if __name__ == "__main__":
    ds = days()
    shares = []
    split = 0
    for d in ds:
        g, b = day_marks(d)
        shares.append(len(g) / (len(g) + len(b)))
        virtues = any(m in g for m in ("tian de", "yue de", "tian she"))
        breakers = any(m[:2] in ("R3", "R4") for m in b)
        if virtues and breakers:
            split += 1
    g, b = day_marks(ds[1])
    top = [p[0] in g for p in permutations(g + b)]
    print("   check on {}: enumerated {:.3f}, formula {:.3f}".format(
        ds[1]["date"].isoformat(), sum(top) / len(top),
        len(g) / (len(g) + len(b))))
    fixed = sum(1 for s in shares if s in (0.0, 1.0))
    open_ = sum(1 for s in shares if 0.25 <= s <= 0.75)
    print("   verdict the same under every ranking: {} days".format(fixed))
    print("   called good by 25% to 75% of rankings: {} days".format(open_))
    print("   'virtues first' and 'breakers first' disagree: {} days"
          .format(split))
#    check on 2027-01-02: enumerated 0.400, formula 0.400
#    verdict the same under every ranking: 113 days
#    called good by 25% to 75% of rankings: 249 days
#    'virtues first' and 'breakers first' disagree: 25 days

有五种吉标与五种凶标时,一种排序下某天的判定,就是它所带标记中排位最高者的吉凶;在全部 10! 种排序中,带 gg 个吉标、bb 个凶标的日子,被判为吉的比例是 g/(g+b)g/(g+b)(对 2027 年 1 月 2 日逐一枚举,得到 0.400,与公式相同)。2027 年只有 113 天在每一种排序下判定都相同;249 天被 25% 到 75% 的排序判为吉;有 25 天,「德先」与「煞先」这两种最简单的排序意见相反。官方排序并没有发现哪些日子是吉日,而是规定了它们,这正是需要朝廷权威来确定一种排序的原因。

《高人的箴言》中的卢恩

原典

《高人的箴言》(Hávamál)第 138、139 节(《诗体埃达》)

Veit ek, at ek hekk vindga meiði á nætr allar níu, geiri undaðr ok gefinn Óðni, sjalfr sjalfum mér, á þeim meiði, er manngi veit hvers af rótum renn.

Við hleifi mik sældu né við hornigi; nýsta ek niðr, nam ek upp rúnar, æpandi nam, fell ek aftr þaðan.

(Neckel and Kuhn 1983; Larrington 2014)

大意是:「我知道,我在狂风吹拂的树上吊了整整九夜,被长矛刺伤,献给奥丁,我自己献给我自己,在那棵无人知其根源何在的树上。没有人给我面包,也没有人给我角杯;我向下凝视,我拾起卢恩,呼喊着拾起,然后从那里跌落。」这两节讲的是通过献祭赢得卢恩。它们没有描述把卢恩当作签来抽,也没有任何倒置读法。三个 aett 的算术仍然值得一算,因为现代牌阵就建立在它们之上。

推导

# Chapter 7. p13: Counting with the three aettir. The Elder Futhark has
# 24 runes in three aettir (families) of 8. Exact counts for a Norns
# reading of 3 ordered runes: orders without and with orientation (a
# reversible rune doubles the readings), and the chance that the three
# come from three different aettir or all from one; and for a cast of
# nine (as in the nine nights of Havamal 138), the number of readings.
from itertools import permutations
from math import perm

FUTHARK = ("Fehu Uruz Thurisaz Ansuz Raidho Kenaz Gebo Wunjo "
           "Hagalaz Naudhiz Isa Jera Eihwaz Perthro Algiz Sowilo "
           "Tiwaz Berkano Ehwaz Mannaz Laguz Ingwaz Dagaz Othala").split()
SAME_TURNED = {"Gebo", "Hagalaz", "Naudhiz", "Isa", "Jera", "Eihwaz",
               "Sowilo", "Ingwaz", "Dagaz"}

if __name__ == "__main__":
    idx = range(24)
    rev = [FUTHARK[i] not in SAME_TURNED for i in idx]
    orders = with_turn = spread3 = same1 = 0
    for t in permutations(idx, 3):
        orders += 1
        with_turn += 2 ** sum(rev[i] for i in t)
        fam = {i // 8 for i in t}
        spread3 += len(fam) == 3
        same1 += len(fam) == 1
    print("   Norns: {:,} ordered readings, {:,} with orientation".format(
        orders, with_turn))
    print("   one rune from each aett: {:.3f}; all from one aett: {:.3f}"
          .format(spread3 / orders, same1 / orders))
    nine = perm(24, 9)
    print("   nine runes: {:.4e} ordered casts".format(nine))
#    Norns: 12,144 ordered readings, 51,504 with orientation
#    one rune from each aett: 0.253; all from one aett: 0.083
#    nine runes: 4.7447e+11 ordered casts

命运三女神阵中三个符文的有序排列共 12,144 种,若每个可逆符文都可正可倒,则有 51,504 种。三个符文分属三族的概率是 0.253,全属同一族的概率是 0.083;九符文抽取的有序排列有 4.7447e+11 种。第 138 节的「九夜」常被与九符文抽取联系起来;这种联系是现代的。

假说 · 尚未验证

作者的诠释(尚未验证): 在有官方规定的规则排序的通书传统中,同一传统内出版的通书彼此之间对吉日的一致程度,远高于没有官方排序的传统。什么会证明它错: 遵循官方排序的通书彼此之间的一致程度,并不高于各自独立的商业通书。

小结

睡虎地《日书》并列抄有两套建除系统,所以对立的流派与建除一样古老。任何吉凶标记的排序,在 2027 年只能确定 113 天的判定;其余由排序本身决定,而这正是朝廷官书所提供的。《高人的箴言》讲述奥丁如何得到卢恩,没有提到任何逆位读法。

参考文献

Harkness, Ethan. 2019. “Good Days and Bad Days: Echoes of the Third-Century BCE Qin Conquest in Early Chinese Hemerology.” Journal of the American Oriental Society 139 (3).
Larrington, Carolyne. 2014. The Poetic Edda. Oxford University Press.
Neckel, Gustav, and Hans Kuhn, eds. 1983. Edda: Die Lieder Des Codex Regius Nebst Verwandten Denkmälern. 5th ed. Winter.
允禄 et al. 乾隆年间. 钦定协纪辨方书. 内府.
李家浩. 1999. “睡虎地秦简《日书》「楚除」的性质及其他.” 中央研究院历史语言研究所集刊 70 (4).
睡虎地秦墓竹简整理小组. 1990. 睡虎地秦墓竹简. 文物出版社.

Fan, Y. (2026). Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics: Constraint Satisfaction Paradoxes, Solar-Term Phase Jumps and Elder Futhark Inversion Distributions [黄历择吉布尔格、建除十二直同余与卢恩符文组合学] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090239 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).