Block #502,887

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2014, 5:28:48 PM · Difficulty 10.8082 · 6,303,544 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
05f37d5f1ce86792e2083206394ee07b0a57cf4d31484839afe92fbf97ebd9d1

Height

#502,887

Difficulty

10.808182

Transactions

12

Size

3.06 KB

Version

2

Bits

0acee505

Nonce

215,849,189

Timestamp

4/20/2014, 5:28:48 PM

Confirmations

6,303,544

Merkle Root

4af618be82ced84fc8c69d30e38d374e7e911f02ba35aa236a8be3d69597e5c8
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.571 × 10⁹⁷(98-digit number)
15710303673498534681…48751318841593092679
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.571 × 10⁹⁷(98-digit number)
15710303673498534681…48751318841593092679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.142 × 10⁹⁷(98-digit number)
31420607346997069363…97502637683186185359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.284 × 10⁹⁷(98-digit number)
62841214693994138727…95005275366372370719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.256 × 10⁹⁸(99-digit number)
12568242938798827745…90010550732744741439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.513 × 10⁹⁸(99-digit number)
25136485877597655491…80021101465489482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.027 × 10⁹⁸(99-digit number)
50272971755195310982…60042202930978965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.005 × 10⁹⁹(100-digit number)
10054594351039062196…20084405861957931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.010 × 10⁹⁹(100-digit number)
20109188702078124392…40168811723915863039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.021 × 10⁹⁹(100-digit number)
40218377404156248785…80337623447831726079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.043 × 10⁹⁹(100-digit number)
80436754808312497571…60675246895663452159
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,695,545 XPM·at block #6,806,430 · 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