Block #2,471,118

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2018, 1:21:27 PM · Difficulty 10.9617 · 4,367,180 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8787921b66e50032f2ffb45cfd8d1154ac70260f39b4236da80031f1e0e6fb6d

Height

#2,471,118

Difficulty

10.961679

Transactions

3

Size

1.03 KB

Version

2

Bits

0af6309a

Nonce

772,432,507

Timestamp

1/13/2018, 1:21:27 PM

Confirmations

4,367,180

Merkle Root

c031bb6b42be664198c4e8d5c4f340556f3c8d503c5255e664e3adcd244a2935
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.486 × 10⁹⁵(96-digit number)
24862703315449244849…02612592099176396799
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.486 × 10⁹⁵(96-digit number)
24862703315449244849…02612592099176396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.972 × 10⁹⁵(96-digit number)
49725406630898489699…05225184198352793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.945 × 10⁹⁵(96-digit number)
99450813261796979399…10450368396705587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.989 × 10⁹⁶(97-digit number)
19890162652359395879…20900736793411174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.978 × 10⁹⁶(97-digit number)
39780325304718791759…41801473586822348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.956 × 10⁹⁶(97-digit number)
79560650609437583519…83602947173644697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.591 × 10⁹⁷(98-digit number)
15912130121887516703…67205894347289395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.182 × 10⁹⁷(98-digit number)
31824260243775033407…34411788694578790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.364 × 10⁹⁷(98-digit number)
63648520487550066815…68823577389157580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.272 × 10⁹⁸(99-digit number)
12729704097510013363…37647154778315161599
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,950,660 XPM·at block #6,838,297 · 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