Block #590,950

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2014, 4:52:23 PM · Difficulty 10.9451 · 6,226,889 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
24ce6173e03424a13fa896a99efeea313a95344044334c917290f50ceb1d1eb9

Height

#590,950

Difficulty

10.945075

Transactions

8

Size

2.61 KB

Version

2

Bits

0af1f070

Nonce

125,500,755

Timestamp

6/16/2014, 4:52:23 PM

Confirmations

6,226,889

Merkle Root

c8b2bc583ee9c60cbddba2fc69ebd85563b078dc0c6be782fcb7adc3d2a26cfe
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.

2.718 × 10⁹⁸(99-digit number)
27188912350140565915…97568505993593173759
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
2.718 × 10⁹⁸(99-digit number)
27188912350140565915…97568505993593173759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.437 × 10⁹⁸(99-digit number)
54377824700281131830…95137011987186347519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.087 × 10⁹⁹(100-digit number)
10875564940056226366…90274023974372695039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.175 × 10⁹⁹(100-digit number)
21751129880112452732…80548047948745390079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.350 × 10⁹⁹(100-digit number)
43502259760224905464…61096095897490780159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.700 × 10⁹⁹(100-digit number)
87004519520449810929…22192191794981560319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.740 × 10¹⁰⁰(101-digit number)
17400903904089962185…44384383589963120639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.480 × 10¹⁰⁰(101-digit number)
34801807808179924371…88768767179926241279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.960 × 10¹⁰⁰(101-digit number)
69603615616359848743…77537534359852482559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.392 × 10¹⁰¹(102-digit number)
13920723123271969748…55075068719704965119
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,786,776 XPM·at block #6,817,838 · 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.
Privacy Policy·

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