What does Text Feeds, Pinned Comments and Affiliate EPC conclude, in numbers, about “Account Health: the Sequential Probability Ratio Test and the Expected Value of a Boosting Network”?

Answer: Chapter 6 monitors account health with a sequential probability ratio test and computes the expected value of a boosting network: once the probability of identification exceeds 0.00019, a five-account network is worth less than one compliant account.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is general business analysis, not legal, tax or financial advice, and it promises no income.

中文版

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

52-week expected reach, honest single account = 52.00
khvalueP(alive at week 52)
20.000536.800.3534
50.000528.880.0742
100.000522.220.0055
20.002013.580.0155
50.00207.220.0000
100.00204.770.0000
20.00505.180.0000
50.00502.460.0000
100.00501.360.0000
hazard h at which a k-account network ties the honest one
k =2: h* = 0.00013
k =5: h* = 0.00019
k = 10: h* = 0.00019
Show the full program
# Chapter 6. p63: why a mutual-boosting network is a losing bet.
# Expected value only; no method is described. An operator who runs k
# accounts that boost one another performs m coordinated actions per
# account per week. If each such action is identified with probability
# h, and enforcement removes the whole network together with its
# affiliate eligibility, the network survives week t with probability
# (1 - h)^(k m t). Boosting multiplies weekly reach by 1 + b (k - 1).
# One honest account: reach 1.0 a week, no such hazard. h, m, b are
# illustrative; real enforcement is not a fixed rate.
import math

M, B, WEEKS = 20, 0.15, 52


def value(k, h):
    boost = 1 + B * (k - 1)
    surv = [(1 - h) ** (k * M * t) for t in range(1, WEEKS + 1)]
    return boost * math.fsum(surv), surv[-1]


if __name__ == "__main__":
    print("52-week expected reach, honest single account = 52.00")
    print("    k      h      value   P(alive at week 52)")
    for h in (0.0005, 0.002, 0.005):
        for k in (2, 5, 10):
            v, s = value(k, h)
            print("  {:>3}  {:.4f}  {:>7.2f}   {:.4f}".format(k, h, v, s))
    print("hazard h at which a k-account network ties the honest one")
    for k in (2, 5, 10):
        lo, hi = 0.0, 0.05
        for _ in range(60):
            mid = (lo + hi) / 2
            if value(k, mid)[0] > 52.0:
                lo = mid
            else:
                hi = mid
        print("  k = {:>2}: h* = {:.5f}".format(k, lo))

Single source and citation

Fan, Y. (2026). Text-First Social Feed Traffic Interception, Pinned-Comment Bridge Funnels and High-Commission Affiliate Monetisation (Version 1.0.0), Chapter 6: Account Health: the Sequential Probability Ratio Test and the Expected Value of a Boosting Network. 5D Library. DOI pending

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

BibTeX
@book{fan2026354,
  author    = {Fan, Yafu},
  title     = {Text-First Social Feed Traffic Interception, Pinned-Comment Bridge Funnels and High-Commission Affiliate Monetisation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book