Drop-Rate Mathematics: Models, Assumptions, and Worked Examples

1. Write the trial contract before calculating

A fixed-rate model needs all four statements to be true:

1. Each trial has two outcomes for the target question: success or failure.
2. The success probability p is the same for every included trial.
3. One trial does not change the probability of another.
4. The trial count excludes ineligible attempts, different tables, and changed conditions.

NIST describes the binomial distribution with the same fixed-probability, success-or-failure boundary in its binomial distribution reference. If a game uses a counter, changing rate, without-replacement pool, shared state, or guarantee, a fixed binomial model is not automatically valid.

2. At least one success after repeated fixed trials

For n independent trials with fixed probability p, the chance of no successes is(1 - p)^n. Its complement is:

P(at least one success) = 1 - (1 - p)^n

Hypothetical example

Assume a made-up target chance of 2% per eligible attempt and 50 unchanged attempts. The result is1 - 0.98^50 ≈ 0.6358, or about 63.58%. This does not say that any real item has a 2% rate, and 63.58% is not a guarantee.

For very small probabilities or very large trial counts, software should use numerically stable functions such as -expm1(n × log1p(-p)) instead of subtracting two nearly equal floating-point numbers.

3. Exactly k successes: the binomial distribution

When the same trial contract holds, the probability of exactly k successes is:

P(X = k) = C(n, k) × p^k × (1 - p)^(n-k)

The cumulative binomial distribution sums those terms over a range. For example, “two or fewer” means summing P(X = 0), P(X = 1), and P(X = 2). It is different from the at-least-one complement only because it asks a different question.

The NIST reference gives both the probability mass function and cumulative function. For inference from observed samples, use the separate binomial sampling and confidence-interval guide.

4. Several possible success sources

The correct union formula depends on how the sources relate:

• Mutually exclusive outcomes: add their probabilities.
• Independent sources: use 1 - ∏(1 - pᵢ).
• Dependent, overlapping sources: use inclusion-exclusion or the actual joint distribution.

Hypothetical independent-source example

With independent 10% and 5% target chances, the chance that either succeeds is1 - (0.90 × 0.95) = 0.145, or 14.5%. Adding them also happens to give 15%, but that double counts the 0.5% overlap. The complement-product expression is exact only when independence is a valid assumption.

5. Expected value needs a complete outcome table

Expected value is a probability-weighted average. Penn State's mathematical expectation lessondefines it as the sum of each value multiplied by its probability. For mutually exclusive outcomes:

EV = Σ(valueᵢ × probabilityᵢ)

A calculation is incomplete if it omits common outcomes, double-counts overlapping rewards, combines prices from different dates, or mixes currencies without a declared conversion. A listing price is also not proof of a completed sale.

Hypothetical EV example

Suppose an invented table pays 0 units with 60% probability, 4 units with 30%, and 20 units with 10%. Gross EV is 0×0.60 + 4×0.30 + 20×0.10 = 3.2 units. If each attempt has a known 0.7-unit direct cost, net EV is 2.5 units. That average does not promise a 2.5-unit result on any attempt.

6. Time normalization is a measurement problem

If a complete cycle takes t seconds, cycles per hour are 3600 / t. Multiplying a valid net EV by that throughput produces an expected hourly rate. The clock must include the same stages for every comparison: preparation, travel, action, looting, reset, loading, failures, and selling where relevant.

The dedicated EV and hourly-rate guide distinguishes probability EV from deterministic batch accounting and shows why an incomplete clock can dominate the answer.

7. Guarantees and changing probabilities are separate models

A hard guarantee is a boundary state, not a reason to divide one by the cap and call that the per-attempt probability. A progressive schedule needs the exact state transition and eligibility rules for every step. If those rules are not publicly known, ask for a user-supplied scenario or show only the documented guarantee boundary.

Do not infer a counter reset from a lifetime total, event reward, platform merge, or desired result. See the stateful probability boundary guidefor a worked separation between fixed trials and counter-based systems.

8. A reproducible calculation checklist

1. Name the target event and the exact eligible trial.
2. Record the source, version, and verification date for every fixed mechanic.
3. State whether trials are independent, mutually exclusive, or state-dependent.
4. Keep unknown rates, prices, route times, and valuations editable.
5. Use a complete outcome set and a consistent value unit.
6. Test 0%, 100%, zero trials, guarantee boundaries, and invalid inputs.
7. Publish the inputs and exclusions with the result.

Sources and scope

• NIST/SEMATECH: Binomial Distribution
• Penn State STAT 414: Mathematical Expectation
• LootCalc calculation methodology and evidence policy

These sources support the mathematical definitions. They do not supply any game's drop rate. A game mechanic still needs its own versioned source on the page that uses it.