Block #141,477

2CCLength 9★☆☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/30/2013, 8:29:51 AM · Difficulty 9.8349 · 6,648,250 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
e88289e99254f056f68276a238e58a91ddd90c1598daca0bb74cf3502984d537

Height

#141,477

Difficulty

9.834858

Transactions

3

Size

1.06 KB

Version

2

Bits

09d5b948

Nonce

204,640

Timestamp

8/30/2013, 8:29:51 AM

Confirmations

6,648,250

Merkle Root

b500acc091d28c7323101ca19d5168346dacdbbf35d56499a488b03fc0c5964e
Transactions (3)
1 in → 1 out10.3400 XPM109 B
4 in → 1 out41.6800 XPM501 B
3 in → 1 out31.0300 XPM388 B
Prime Chain Origin

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.

1.094 × 10⁹⁴(95-digit number)
10943010138330792231…87450570189875595481
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.

1
origin + 1
1.094 × 10⁹⁴(95-digit number)
10943010138330792231…87450570189875595481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.188 × 10⁹⁴(95-digit number)
21886020276661584463…74901140379751190961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.377 × 10⁹⁴(95-digit number)
43772040553323168927…49802280759502381921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.754 × 10⁹⁴(95-digit number)
87544081106646337854…99604561519004763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.750 × 10⁹⁵(96-digit number)
17508816221329267570…99209123038009527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.501 × 10⁹⁵(96-digit number)
35017632442658535141…98418246076019055361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.003 × 10⁹⁵(96-digit number)
70035264885317070283…96836492152038110721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.400 × 10⁹⁶(97-digit number)
14007052977063414056…93672984304076221441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.801 × 10⁹⁶(97-digit number)
28014105954126828113…87345968608152442881
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, …
Circulating Supply:57,561,781 XPM·at block #6,789,726 · updates every 60s