Block #2,484,182

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/22/2018, 2:56:34 AM · Difficulty 10.9672 · 4,357,797 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
32b15f0744bf36077cf76adf1c266b3419ca4aa5a8a8fb626957155e02bff414

Height

#2,484,182

Difficulty

10.967191

Transactions

27

Size

6.85 KB

Version

2

Bits

0af799d5

Nonce

605,454,283

Timestamp

1/22/2018, 2:56:34 AM

Confirmations

4,357,797

Merkle Root

d430e30f5bfdefe274858117d077fce9c1fb5a09ff6d35efb2052ee345a9fe10
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.313 × 10⁹⁴(95-digit number)
23130991414388268844…66113384677058365859
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.313 × 10⁹⁴(95-digit number)
23130991414388268844…66113384677058365859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.626 × 10⁹⁴(95-digit number)
46261982828776537688…32226769354116731719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.252 × 10⁹⁴(95-digit number)
92523965657553075377…64453538708233463439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.850 × 10⁹⁵(96-digit number)
18504793131510615075…28907077416466926879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.700 × 10⁹⁵(96-digit number)
37009586263021230150…57814154832933853759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.401 × 10⁹⁵(96-digit number)
74019172526042460301…15628309665867707519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.480 × 10⁹⁶(97-digit number)
14803834505208492060…31256619331735415039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.960 × 10⁹⁶(97-digit number)
29607669010416984120…62513238663470830079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.921 × 10⁹⁶(97-digit number)
59215338020833968241…25026477326941660159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.184 × 10⁹⁷(98-digit number)
11843067604166793648…50052954653883320319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.368 × 10⁹⁷(98-digit number)
23686135208333587296…00105909307766640639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,980,217 XPM·at block #6,841,978 · 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