Block #489,523

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/13/2014, 8:26:26 AM · Difficulty 10.6664 · 6,320,197 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e6ebe115f6f2578aa8b5f5594e125397b5e55b29895c4049ac37be4074bee12b

Height

#489,523

Difficulty

10.666382

Transactions

6

Size

3.90 KB

Version

2

Bits

0aaa97ff

Nonce

316,568

Timestamp

4/13/2014, 8:26:26 AM

Confirmations

6,320,197

Merkle Root

1adaef0401324ed1cb902c1cfc93066551e46198b5fae57e0616904c3cc48f8c
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.

3.400 × 10⁹⁴(95-digit number)
34003306366142663926…43689526494341917349
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
3.400 × 10⁹⁴(95-digit number)
34003306366142663926…43689526494341917349
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.800 × 10⁹⁴(95-digit number)
68006612732285327852…87379052988683834699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.360 × 10⁹⁵(96-digit number)
13601322546457065570…74758105977367669399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.720 × 10⁹⁵(96-digit number)
27202645092914131141…49516211954735338799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.440 × 10⁹⁵(96-digit number)
54405290185828262282…99032423909470677599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.088 × 10⁹⁶(97-digit number)
10881058037165652456…98064847818941355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.176 × 10⁹⁶(97-digit number)
21762116074331304912…96129695637882710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.352 × 10⁹⁶(97-digit number)
43524232148662609825…92259391275765420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.704 × 10⁹⁶(97-digit number)
87048464297325219651…84518782551530841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.740 × 10⁹⁷(98-digit number)
17409692859465043930…69037565103061683199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,721,840 XPM·at block #6,809,719 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy