Block #559,807

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2014, 10:34:17 AM · Difficulty 10.9646 · 6,284,309 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e6ab54bd42b7db5f2375d5bfe41ea9c6c9464622f8cbdcdb874738275444339

Height

#559,807

Difficulty

10.964642

Transactions

9

Size

2.12 KB

Version

2

Bits

0af6f2c5

Nonce

23,635,431

Timestamp

5/24/2014, 10:34:17 AM

Confirmations

6,284,309

Merkle Root

a2c0b9093d961c337ce51de885e5d690286b84d49938312bd69c7acd849fa795
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.043 × 10⁹⁶(97-digit number)
50439375826259742059…06931137936008811201
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.043 × 10⁹⁶(97-digit number)
50439375826259742059…06931137936008811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.008 × 10⁹⁷(98-digit number)
10087875165251948411…13862275872017622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.017 × 10⁹⁷(98-digit number)
20175750330503896823…27724551744035244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.035 × 10⁹⁷(98-digit number)
40351500661007793647…55449103488070489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.070 × 10⁹⁷(98-digit number)
80703001322015587295…10898206976140979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.614 × 10⁹⁸(99-digit number)
16140600264403117459…21796413952281958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.228 × 10⁹⁸(99-digit number)
32281200528806234918…43592827904563916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.456 × 10⁹⁸(99-digit number)
64562401057612469836…87185655809127833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.291 × 10⁹⁹(100-digit number)
12912480211522493967…74371311618255667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.582 × 10⁹⁹(100-digit number)
25824960423044987934…48742623236511334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.164 × 10⁹⁹(100-digit number)
51649920846089975869…97485246473022668801
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,997,303 XPM·at block #6,844,115 · 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