What does The Name-Number, Digit-Field and Brand-Naming Codex conclude, in numbers, about “The Eight Stars of Digit Pairs: Sixty-Four Pairs, Plain, Hidden and Shown, and the Weight of the Tail”?
Answer: Chapter 6 reads the plain, hidden and shown forms of the eight stars: random numbers average 48.13 points, and swapping the last four digits moves one number by 71.0 points from best to worst.
Scope of the numbers: It is not legal, investment or other professional advice.
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: 48.13
exact, endless uniform digits: plain 0.8000, hidden only 0.0889, shown only 0.0889, both 0.0222
draws 200,000, mean pairs per number 8.058
modifiers: plain 0.8269 hid 0.0704 shown 0.0859 hidshown 0.0168
star share per pair: Tianyi 0.1293 Shengqi 0.1293 Yannian 0.1295 Fuwei 0.1120
Jueming 0.1117 Wugui 0.1295 Liusha 0.1291 Huohai 0.1295
score mean 48.13, sd 15.69, share >= 60: 0.2265, share < 40: 0.3051
no negative star at all: 0.0052; at least one Jueming pair: 0.6130
dominant star (station tie-break: count, then weight):
Tianyi 0.2230 Shengqi 0.1658 Yannian 0.1660 Fuwei 0.0969
Jueming 0.0537 Wugui 0.0982 Liusha 0.0972 Huohai 0.0992
pairs ending in the last four digits: 0:0.0017 1:0.0259 2:0.1542 3:0.4079 4:0.4104
first pair when the number starts 1 then 3,4,6,7,8,9: Huohai Liusha Shengqi Tianyi Wugui YannianShow the full program
# Chapter 6. p61: How often each star and modifier turns up in random numbers, scored as the station does.
# The pair rule and the score are copied from fleet1_meta.number_pairs / number_score: digits 0 and 5
# are skipped, neighbouring remaining digits form a pair, a 0 between them marks it hidden (x 0.5),
# a 5 marks it shown (x 1.5), a pair ending in the last four digits counts double, and
# score = clamp(50 + 6 * total / pairs * 2.2, 3, 98). Model number: 11 digits, "1", then 3 to 9,
# then nine uniform digits. Seed written out; 200,000 draws.
import random
from collections import Counter
STAR_PAIRS = {
"Tianyi": ["13", "31", "68", "86", "49", "94", "27", "72"],
"Shengqi": ["14", "41", "76", "67", "39", "93", "28", "82"],
"Yannian": ["19", "91", "78", "87", "34", "43", "26", "62"],
"Fuwei": ["11", "22", "99", "88", "77", "66", "33", "44"],
"Jueming": ["12", "21", "69", "96", "48", "84", "37", "73"],
"Wugui": ["18", "81", "79", "97", "36", "63", "24", "42"],
"Liusha": ["16", "61", "74", "47", "38", "83", "29", "92"],
"Huohai": ["17", "71", "89", "98", "46", "64", "23", "32"],
}
PAIR_STAR = {p: s for s, ps in STAR_PAIRS.items() for p in ps}
W = {"Tianyi": 3, "Shengqi": 2, "Yannian": 2, "Fuwei": 1,
"Jueming": -3, "Wugui": -2, "Liusha": -2, "Huohai": -2}
def number_pairs(digits):
core = [(c, i) for i, c in enumerate(digits) if c not in "05"]
out = []
for (a, ia), (b, ib) in zip(core, core[1:]):
between = digits[ia + 1: ib]
mod = ("hid" if "0" in between else "") + ("shown" if "5" in between else "")
out.append({"pair": a + b, "pos": ib, "star": PAIR_STAR[a + b], "mod": mod})
return out
def number_score(digits):
pairs = number_pairs(digits)
n, tot = len(digits), 0.0
for p in pairs:
w = W[p["star"]] * (2.0 if p["pos"] >= n - 4 else 1.0)
if "hid" in p["mod"]:
w *= 0.5
if "shown" in p["mod"]:
w *= 1.5
p["w"] = round(w, 2)
tot += p["w"]
return pairs, round(max(3, min(98, 50 + 6 * tot / max(1, len(pairs)) * 2.2)), 1)
if __name__ == "__main__":
q = 0.2
plain = 1 - q
one = sum((1 - q) * q ** k * 0.5 ** k for k in range(1, 200))
print(" exact, endless uniform digits: plain {:.4f}, hidden only {:.4f}, shown only {:.4f}, "
"both {:.4f}".format(plain, one, one, q - 2 * one))
rng = random.Random(127)
N = 200000
npairs, mods, stars, dom, tailn = 0, Counter(), Counter(), Counter(), Counter()
scores, noneg, jm = [], 0, 0
for _ in range(N):
d = "1" + str(rng.randint(3, 9)) + "".join(str(rng.randint(0, 9)) for _ in range(9))
pairs, sc = number_score(d)
scores.append(sc)
npairs += len(pairs)
cnt = Counter(p["star"] for p in pairs)
stars.update(cnt)
mods.update(p["mod"] or "plain" for p in pairs)
tailn[sum(1 for p in pairs if p["pos"] >= 7)] += 1
noneg += all(W[p["star"]] > 0 for p in pairs)
jm += cnt["Jueming"] > 0
dom[max(cnt, key=lambda s: (cnt[s], W[s]))] += 1
print(" draws {:,}, mean pairs per number {:.3f}".format(N, npairs / N))
print(" modifiers: " + " ".join("{} {:.4f}".format(k, mods[k] / npairs)
for k in ("plain", "hid", "shown", "hidshown")))
sw = list(W)
print(" star share per pair: " + " ".join("{} {:.4f}".format(s, stars[s] / npairs) for s in sw[:4]))
print(" " + " ".join("{} {:.4f}".format(s, stars[s] / npairs) for s in sw[4:]))
m = sum(scores) / N
sd = (sum((x - m) ** 2 for x in scores) / N) ** 0.5
print(" score mean {:.2f}, sd {:.2f}, share >= 60: {:.4f}, share < 40: {:.4f}".format(
m, sd, sum(x >= 60 for x in scores) / N, sum(x < 40 for x in scores) / N))
print(" no negative star at all: {:.4f}; at least one Jueming pair: {:.4f}".format(noneg / N, jm / N))
print(" dominant star (station tie-break: count, then weight):")
print(" " + " ".join("{} {:.4f}".format(s, dom[s] / N) for s in sw[:4]))
print(" " + " ".join("{} {:.4f}".format(s, dom[s] / N) for s in sw[4:]))
print(" pairs ending in the last four digits: " + " ".join(
"{}:{:.4f}".format(k, tailn[k] / N) for k in sorted(tailn)))
first = Counter(PAIR_STAR["1" + str(b)] for b in (3, 4, 6, 7, 8, 9))
print(" first pair when the number starts 1 then 3,4,6,7,8,9: " + " ".join(sorted(first)))Single source and citation
Fan, Y. (2026). The Name-Number, Digit-Field and Brand-Naming Codex (Version 0.1.0), Chapter 6: The Eight Stars of Digit Pairs: Sixty-Four Pairs, Plain, Hidden and Shown, and the Weight of the Tail. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-127 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026127,
author = {Fan, Yafu},
title = {The Name-Number, Digit-Field and Brand-Naming Codex},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: Kangxi Strokes, the Five-Grid Formulas, the Cycle Above 81 and Base Rates
- Chapter 2 · The Eighty-One Numbers, Part One: 1 to 40
- Chapter 3 · The Eighty-One Numbers, Part Two: 41 to 81
- Chapter 4 · The 125 Three-Talent Configurations and the Division of Labour among the Five Grids
- Chapter 5 · Sound and Shape: Sixteen Tone Patterns, Eight Glyph Structures and Three Homophone Checks
- Chapter 7 · Brand-Naming Rules: Trade Word, Trademark, Sound-Alikes, Domains, Dialects, Recall and Length
- Chapter 8 · Practice: A Fictional Founder's Name, Studio Brand and Phone Number, and Three Pre-Registered Tests