Block #518,736

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2014, 7:14:34 PM · Difficulty 10.8539 · 6,292,242 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
441e0e51ba00ee3532abb54d1af5d341a360b238019ca023fc94b29b206b2dfb

Height

#518,736

Difficulty

10.853933

Transactions

1

Size

698 B

Version

2

Bits

0ada9b5d

Nonce

132,262

Timestamp

4/30/2014, 7:14:34 PM

Confirmations

6,292,242

Merkle Root

011d0f2ebe2dd1f3a8042f5991d64e59c7dde9db75bbb18e09b77b624eeec5b1
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.

3.076 × 10⁹⁶(97-digit number)
30763866677849986479…02580118826520830081
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
3.076 × 10⁹⁶(97-digit number)
30763866677849986479…02580118826520830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.152 × 10⁹⁶(97-digit number)
61527733355699972958…05160237653041660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.230 × 10⁹⁷(98-digit number)
12305546671139994591…10320475306083320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.461 × 10⁹⁷(98-digit number)
24611093342279989183…20640950612166640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.922 × 10⁹⁷(98-digit number)
49222186684559978366…41281901224333281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.844 × 10⁹⁷(98-digit number)
98444373369119956733…82563802448666562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.968 × 10⁹⁸(99-digit number)
19688874673823991346…65127604897333125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.937 × 10⁹⁸(99-digit number)
39377749347647982693…30255209794666250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.875 × 10⁹⁸(99-digit number)
78755498695295965386…60510419589332500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.575 × 10⁹⁹(100-digit number)
15751099739059193077…21020839178665000961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.150 × 10⁹⁹(100-digit number)
31502199478118386154…42041678357330001921
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,731,927 XPM·at block #6,810,977 · 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