What does Seven-Day Ignition and Firepower Concentration conclude, in numbers, about “Four Response Shapes and the Firepower Concentration Ratio”?
Answer: Chapter 2 defines the firepower concentration ratio; in an illustrative catalog pushing only the top three earns 0.805 of the optimum.
Scope of the numbers: Its parameters are illustrative and prices are in illustrative units without currency; all calculations are generated by its programs; it is not individual business advice and promises no income. Chapter 2 defines the firepower concentration ratio; in an illustrative catalog pushing only the top three earns 0.805 of the optimum.
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.805
| A. best plan per response shape (X | 120, 30 candidates) |
| shape value active HHI | 1/HHI |
| concave | 144.81 13 0.131 7.61 |
| fixed cost | 96.85 4 0.259 3.87 |
| switching | 124.25 5 0.219 4.56 |
| S-shape | 153.88 6 0.170 5.88 |
| B. forced plans: top 3 only vs all 30 equal | |
| shape top3 all30_equal top3/best | |
| concave | 116.51 91.50 0.805 |
| fixed cost | 92.51 -148.50 0.955 |
| switching | 113.99 0.00 0.917 |
| S-shape | 121.59 13.96 0.790 |
| C. S-shape check, unrestricted DP over all 30 | 153.88 |
Show the full program
# Chapter 2. p22: concentration (Herfindahl) against seven-day cash
# 30 candidate assets with ceilings M_i = 60 * i^-0.7 (illustrative), a
# weekly firepower budget X = 120 units, the four shapes of p21.
# For k active assets (the top k, since shapes are equal) we find the
# best split: water-filling in 0.25-unit steps for the concave family,
# a knapsack-style DP in 1-unit steps for the S shape. HHI = sum of
# squared firepower shares; 1/HHI is the "effective number" of assets.
import heapq
import math
X, S, F, H, K, DELTA = 120.0, 15.0, 8.0, 3.0, 12.0, 0.05
MS = [60.0 * (i + 1) ** -0.7 for i in range(30)]
def conc(m, x):
return m * (1.0 - math.exp(-x / S))
def sfun(m, x):
return m * x ** H / (K ** H + x ** H) if x > 0 else 0.0
def waterfill(k, budget, step=0.25):
cnt = [0] * k
x = [0.0] * k
heap = [(-(conc(MS[i], step) - conc(MS[i], 0.0)), i) for i in range(k)]
heapq.heapify(heap)
for _ in range(int(round(budget / step))):
_, i = heapq.heappop(heap)
cnt[i] += 1
x[i] = cnt[i] * step
gain = conc(MS[i], x[i] + step) - conc(MS[i], x[i])
heapq.heappush(heap, (-gain, i))
return x
def hhi(x):
tot = math.fsum(x)
return math.fsum((v / tot) ** 2 for v in x if v > 0)
def best_concave(fixed, delta, kmax=30):
best = None
for k in range(1, kmax + 1):
budget = X * max(0.0, 1.0 - delta * (k - 1))
x = waterfill(k, budget)
val = math.fsum(conc(MS[i], x[i]) for i in range(k)) - fixed * k
if best is None or val > best[0] + 1e-12:
best = (val, k, hhi(x))
return best
def best_s(kmax=30):
nb = int(X)
dp = [0.0] * (nb + 1)
for i in range(kmax):
new = dp[:]
for b in range(nb + 1):
for x in range(1, b + 1):
v = dp[b - x] + sfun(MS[i], x)
if v > new[b]:
new[b] = v
dp = new
return dp[nb]
def s_alloc_topk(k):
# exact DP restricted to the top k, returns value and allocation
nb = int(X)
dp = [0.0] * (nb + 1)
choice = []
for i in range(k):
new, ch = dp[:], [0] * (nb + 1)
for b in range(nb + 1):
for x in range(1, b + 1):
v = dp[b - x] + sfun(MS[i], x)
if v > new[b]:
new[b], ch[b] = v, x
dp = new
choice.append(ch)
x, b = [0] * k, nb
for i in range(k - 1, -1, -1):
x[i] = choice[i][b]
b -= x[i]
return dp[nb], x
print("A. best plan per response shape (X = 120, 30 candidates)")
print("shape value active HHI 1/HHI")
for name, fx, dl in (("concave", 0.0, 0.0), ("fixed cost", F, 0.0),
("switching", 0.0, DELTA)):
v, k, h = best_concave(fx, dl)
print("{:<11} {:6.2f} {:6d} {:.3f} {:5.2f}".format(name, v, k, h,
1.0 / h))
sv, sx = s_alloc_topk(30)
act = [v for v in sx if v > 0]
hs = hhi([float(v) for v in act])
print("{:<11} {:6.2f} {:6d} {:.3f} {:5.2f}".format(
"S-shape", sv, len(act), hs, 1.0 / hs))
print("B. forced plans: top 3 only vs all 30 equal")
print("shape top3 all30_equal top3/best")
for name, fx, dl in (("concave", 0.0, 0.0), ("fixed cost", F, 0.0),
("switching", 0.0, DELTA)):
x3 = waterfill(3, X * (1.0 - dl * 2))
t3 = math.fsum(conc(MS[i], x3[i]) for i in range(3)) - fx * 3
eq = X * max(0.0, 1.0 - dl * 29) / 30.0
a30 = math.fsum(conc(m, eq) for m in MS) - fx * 30
print("{:<11} {:6.2f} {:11.2f} {:9.3f}".format(
name, t3, a30, t3 / best_concave(fx, dl)[0]))
s3, _ = s_alloc_topk(3)
s30 = math.fsum(sfun(m, X / 30.0) for m in MS)
print("{:<11} {:6.2f} {:11.2f} {:9.3f}".format("S-shape", s3, s30,
s3 / sv))
print("C. S-shape check, unrestricted DP over all 30 = {:.2f}".format(
best_s()))Single source and citation
Fan, Y. (2026). Seven-Day Cashflow Ignition from Large Digital Asset Catalogs: Firepower Concentration Ratios and Saturation Monetisation Sprints (Version 1.0.0), Chapter 2: Four Response Shapes and the Firepower Concentration Ratio. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-415 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026415,
author = {Fan, Yafu},
title = {Seven-Day Cashflow Ignition from Large Digital Asset Catalogs: Firepower Concentration Ratios and Saturation Monetisation Sprints},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Why the Square Law Does Not Move into Marketing
- Chapter 3 · Three Sources of a Return to Concentration: Fixed Costs, Switching Costs and Exposure Thresholds
- Chapter 4 · Taking Stock of Three Hundred Assets and Choosing the Knives
- Chapter 5 · Trial Firing and Culling: Which Knives to Try First, and When to Change
- Chapter 6 · The Seven-Day Schedule, the Probability of Reaching the Target, and Stop-Loss and Add-On Rules
- Chapter 7 · Sunzi and Clausewitz: The Classical Sources on Concentration Examined
- Chapter 8 · Field Tools and Checker Specifications: The Ledger, the Red Flags and the Pre-Registered Tests