Reduction

Reduction (also called Full Reduction or Pythagorean) reduces each letter's ordinal value to a single digit, then sums those digits. A=1, J=1, S=1; B=2, K=2, T=2; etc.

Digit-sum each ordinal · A = 1, J = 1, S = 1 …

Press Calculate or hit Enter. Letters A–Z are counted.

About this cipher

Reduction is the bridge between gematria and Pythagorean numerology. The technique is the same as the Hebrew Mispar Katan ('small count') applied to the English alphabet — every letter's contribution is reduced to 1–9.

Because the per-letter values are small, Reduction totals are also small. This makes equal-sum matches more frequent and is part of why the decoder community considers Reduction one of the more 'lively' ciphers — patterns surface easily.

Worked example

Input: TORAH

Result: 26

T (20 → 2) + O (15 → 6) + R (18 → 9) + A (1) + H (8) = 2 + 6 + 9 + 1 + 8 = 26. Digital root: 2 + 6 = 8.

Frequently asked

  • Is Reduction the same as Pythagorean numerology?

    It uses the same per-letter values (A=1, B=2, …, I=9, J=1, K=2, …) but is summed across the whole word rather than treated per-letter. The numbers are the same; the framework around them differs.

  • What's the Hebrew equivalent of Reduction?

    Mispar Katan — the classical 'small count' that reduces each Hebrew letter to a single digit (Aleph=1, Yud=1, Qof=1; Bet=2, Kaf=2, Resh=2; etc.).

  • Why are Reduction totals so small?

    Because every letter contributes at most 9. So a 5-letter word has a maximum Reduction value of 45.

← All methods