What does Blind Boxes, Hidden Variants and Odds Disclosure conclude, in numbers, about “The Seller's Design Choices: Case Packing, Set-Completion Prizes and Two Allocation Rules”?
Answer: Packing cases without repeats raises the chance of completing the regulars from `4.941e-05` to 0.9167, a ratio of 18551, while the "1/144" on the package is unchanged. Set-completion prizes turn the collecting multiplier into a cost multiplier: six rare items at 1 % take 245.0 draws, 2.45 times a single one, and Japan held such schemes to be prohibited in 2012. Under the same stated 1/144, the number of hidden variants in a run of 7,200 independently filled boxes has a standard deviation of 7.05, and only fixed allocation can guarantee "50 in this run". The seller's design choices are now covered. Where did these rules and odds first appear? What testable claims did the market streets of the East and the studies of the West leave behind? Chapter 7 returns to the classical sources.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is general information, not individualised legal or financial advice, and every statute must be checked by a person before listing. Chapter 5 computes a lucky bag's mean, spread and chance of being worth less than its price (0.8280 for the illustrative bag) and the weighting of small chances.
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: -05, 0.9167, 144, 18551, 4.941
| sealed case of 12: | |
| P(all 12 regulars) | 0.9167 |
| P(hidden in this case) | 0.0833 |
| E[distinct regulars] | 11.9167 |
| hidden per box, long run | 1/144 |
| 12 random boxes: | |
| P(all 12 regulars) | 4.941e-05 |
| P(at least one hidden) | 0.0802 |
| E[distinct regulars] | 7.7439 |
| ratio of full-set chances, case / random | 18551 |
| store receiving c cases: P(no hidden at all) | |
| (stratified = exactly one hidden per carton of 12 cases) | |
| c | 1: independent 0.9167 stratified 0.9167 |
| c | 6: independent 0.5933 stratified 0.5000 |
| c | 12: independent 0.3520 stratified 0.0000 |
| c | 24: independent 0.1239 stratified 0.0000 |
| c | 36: independent 0.0436 stratified 0.0000 |
Show the full program
# Chapter 6. p61: a sealed case of 12 versus 12 random boxes.
# Illustrative packing rule: each case holds every regular design once;
# with probability 1/12 per case the hidden variant replaces one regular
# chosen at random, so the long-run hidden rate is 1/144 per box.
# Random boxes: designs drawn independently (same 1/144 hidden rate).
# Stratified cartons: exactly one hidden case in each carton of 12
# cases, and a store's cases come from a single carton (illustrative).
from fractions import Fraction
import math
n = 12
h_case = Fraction(1, 12)
p_full_case = 1 - h_case
print("sealed case of 12:")
print(" P(all 12 regulars) = {:.4f}".format(float(p_full_case)))
print(" P(hidden in this case) = {:.4f}".format(float(h_case)))
print(" E[distinct regulars] = {:.4f}".format(
float(12 - h_case)))
print(" hidden per box, long run = 1/{}".format(int(1 / (h_case / 12))))
ph = Fraction(1, 144)
pr = (1 - ph) / 12
full = Fraction(math.factorial(12)) * pr ** 12
print("12 random boxes:")
print(" P(all 12 regulars) = {:.3e}".format(float(full)))
print(" P(at least one hidden) = {:.4f}".format(
float(1 - (1 - ph) ** 12)))
dist = 12 * (1 - (1 - pr) ** 12)
print(" E[distinct regulars] = {:.4f}".format(float(dist)))
print("ratio of full-set chances, case / random = {:.0f}".format(
float(p_full_case / full)))
print()
print("store receiving c cases: P(no hidden at all)")
print(" (stratified = exactly one hidden per carton of 12 cases)")
for c in (1, 6, 12, 24, 36):
strat = max(Fraction(0), Fraction(12 - c, 12))
print(" c = {:2d}: independent {:.4f} stratified {:.4f}".format(
c, float((1 - h_case) ** c), float(strat)))Single source and citation
Fan, Y. (2026). Blind-Box Coupon Collecting, Geometric Waits for Hidden Variants and Odds Disclosure for Lucky Bags (Version 1.0.0), Chapter 6: The Seller's Design Choices: Case Packing, Set-Completion Prizes and Two Allocation Rules. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-210 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026210,
author = {Fan, Yafu},
title = {Blind-Box Coupon Collecting, Geometric Waits for Hidden Variants and Odds Disclosure for Lucky Bags},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · How Many Boxes for Twelve Designs: Harmonic Numbers, Variance and the Full Distribution
- Chapter 2 · The Hidden Variant at 1/144: Geometric Waits, Quantiles and Guarantees
- Chapter 3 · Collecting under Unequal Odds: Inclusion–Exclusion, a Poissonisation Integral and Tilted Designs
- Chapter 4 · Duplicates, Pooling and Buying the Gaps: the Double Dixie Cup and When to Stop Opening
- Chapter 5 · Expected Value and Spread of a Lucky Bag: Tiers, Convolution and the Weighting of Small Chances
- Chapter 7 · Classical Sources East and West: Guanpu in the Dongjing Meng Hua Lu and de Moivre's De Mensura Sortis
- Chapter 8 · Closing the Loop: an Odds-Disclosure Generator for Lucky-Bag Pages, a Taiwan and Malaysia Checklist and a Pre-Registered Audit