Block #2,475,385

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2018, 8:10:24 AM · Difficulty 10.9637 · 4,364,693 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e96ac40f87dd9f590ee141a55092f43c4940cdd6d6ea6e55b314cfbe47716a7

Height

#2,475,385

Difficulty

10.963705

Transactions

37

Size

13.99 KB

Version

2

Bits

0af6b562

Nonce

1,260,553,569

Timestamp

1/16/2018, 8:10:24 AM

Confirmations

4,364,693

Merkle Root

67e8077c4a088e40b38292c342a1037f2fc84717b59b5508eee4d1563c421854
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.

5.450 × 10⁹⁴(95-digit number)
54509169500292503171…04424143208427582879
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
5.450 × 10⁹⁴(95-digit number)
54509169500292503171…04424143208427582879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.090 × 10⁹⁵(96-digit number)
10901833900058500634…08848286416855165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.180 × 10⁹⁵(96-digit number)
21803667800117001268…17696572833710331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.360 × 10⁹⁵(96-digit number)
43607335600234002537…35393145667420663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.721 × 10⁹⁵(96-digit number)
87214671200468005074…70786291334841326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.744 × 10⁹⁶(97-digit number)
17442934240093601014…41572582669682652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.488 × 10⁹⁶(97-digit number)
34885868480187202029…83145165339365304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.977 × 10⁹⁶(97-digit number)
69771736960374404059…66290330678730608639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.395 × 10⁹⁷(98-digit number)
13954347392074880811…32580661357461217279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.790 × 10⁹⁷(98-digit number)
27908694784149761623…65161322714922434559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.581 × 10⁹⁷(98-digit number)
55817389568299523247…30322645429844869119
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,964,931 XPM·at block #6,840,077 · 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