What does Password Entropy and Least Privilege conclude, in numbers, about “The Permission Graph and its Minimum Cover: a One-Person Firm's Blast Radius”?

Answer: Chapter 6 uses minimum role covers and the recovery graph to show that the illustrative firm expects to lose 0.4972 accounts a year, and 0.1899 after hardening the main mailbox alone.

Scope of the numbers: Its firms, accounts and probabilities are illustrative, and all calculations are generated by its programs; it is not personalised business, legal, financial or compliance advice, and its audit routine and tool never touch a real password. Chapter 6 uses minimum role covers and the recovery graph to show that the illustrative firm expects to lose 0.4972 accounts a year, and 0.1899 after hardening the main mailbox alone.

中文版

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: 0.1899, 0.4972

kbest set (exhaustive)loss/yrcovers jewels
0-0.4972False
1mail0.1899True
2mail+social0.1409True
3cloud+mail+social0.1019True
greedy order: mail > social > cloud
smallest cover of the jewels: mail
Show the full program
# Chapter 6. p63: the smallest set of accounts to harden first.
# Hardening an account (phishing-resistant second factor, recovery
# locked) cuts its outgoing reset edges and divides its direct chance by
# 50 (illustrative). Exhaustive search over all sets of size k on the
# p62 graph minimises expected accounts lost per year; a greedy pick is
# shown for comparison. A "cover" is a set that leaves the crown jewels
# (bank, domain) reachable only from themselves.
import math
from itertools import combinations

EDGES = {
    "phone": ["mail"], "domain": ["mail"],
    "mail": ["bank", "store", "cloud", "books", "social", "domain"],
    "cloud": ["store"], "store": [], "bank": [], "books": [],
    "social": [],
}
P = {"phone": 0.01, "domain": 0.01, "mail": 0.03, "cloud": 0.02,
     "store": 0.03, "bank": 0.01, "books": 0.02, "social": 0.05}
JEWELS = ("bank", "domain")
FACTOR = 50.0


def reach(edges, start):
    seen, stack = {start}, [start]
    while stack:
        u = stack.pop()
        for v in edges.get(u, []):
            if v not in seen:
                seen.add(v)
                stack.append(v)
    return seen


def harden(hard):
    e = {u: ([] if u in hard else vs) for u, vs in EDGES.items()}
    p = {u: (x / FACTOR if u in hard else x) for u, x in P.items()}
    return e, p


def loss(hard):
    e, p = harden(hard)
    nodes = sorted(p)
    r = {u: reach(e, u) for u in nodes}
    return math.fsum(1.0 - math.prod(1.0 - p[u] for u in nodes
                                     if v in r[u]) for v in nodes)


def covers(hard):
    e, _ = harden(hard)
    return all(not any(j in reach(e, u) for u in P if u != j)
               for j in JEWELS)


nodes = sorted(P)
print("k  best set (exhaustive)        loss/yr  covers jewels")
print("0  {:<27s}  {:.4f}  {}".format("-", loss(()), covers(())))
for k in (1, 2, 3):
    best = min((loss(c), c) for c in combinations(nodes, k))
    print("{}  {:<27s}  {:.4f}  {}".format(
        k, "+".join(best[1]), best[0], covers(best[1])))
chosen = []
for _ in range(3):
    nxt = min((loss(tuple(chosen) + (u,)), u) for u in nodes
              if u not in chosen)
    chosen.append(nxt[1])
print("greedy order: {}".format(" > ".join(chosen)))
small = min((len(c), c) for k in range(1, len(nodes) + 1)
            for c in combinations(nodes, k) if covers(c))
print("smallest cover of the jewels: {}".format("+".join(small[1])))

Single source and citation

Fan, Y. (2026). Password Entropy and Credential Stuffing, the Forced-Rotation Paradox and Least-Privilege Accounts for One-Person Firms (Version 1.0.0), Chapter 6: The Permission Graph and its Minimum Cover: a One-Person Firm's Blast Radius. 5D Library. DOI pending

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

BibTeX
@book{fan2026218,
  author    = {Fan, Yafu},
  title     = {Password Entropy and Credential Stuffing, the Forced-Rotation Paradox and Least-Privilege Accounts for One-Person Firms},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book