Block #132,733

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

4.780 × 10⁹³(94-digit number)

47808691320115540131…53057782095760952961

Discovered Prime Numbers

p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

origin + 1

4.780 × 10⁹³(94-digit number)

47808691320115540131…53057782095760952961

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

9.561 × 10⁹³(94-digit number)

95617382640231080263…06115564191521905921

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

1.912 × 10⁹⁴(95-digit number)

19123476528046216052…12231128383043811841

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

3.824 × 10⁹⁴(95-digit number)

38246953056092432105…24462256766087623681

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

7.649 × 10⁹⁴(95-digit number)

76493906112184864210…48924513532175247361

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

1.529 × 10⁹⁵(96-digit number)

15298781222436972842…97849027064350494721

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

3.059 × 10⁹⁵(96-digit number)

30597562444873945684…95698054128700989441

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

6.119 × 10⁹⁵(96-digit number)

61195124889747891368…91396108257401978881

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

1.223 × 10⁹⁶(97-digit number)

12239024977949578273…82792216514803957761

Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 9 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★☆☆☆☆

Rarity

CommonChain length 9

Found in most blocks. The baseline for Primecoin's proof-of-work.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)

Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …

Cross-reference on Chainz Explorer

Block #132,733

Cookie Preferences