Block #555,096

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 8:08:39 AM · Difficulty 10.9627 · 6,254,027 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9700833b7a425b07b884bfd7c563b31131b9d204f9d039cc890877b36c889b4c

Height

#555,096

Difficulty

10.962745

Transactions

6

Size

1.71 KB

Version

2

Bits

0af67670

Nonce

852,120,203

Timestamp

5/21/2014, 8:08:39 AM

Confirmations

6,254,027

Merkle Root

9ce0391d0e529a2a67bbfd35b52581c7204be4ddc38c6c57fdd00f7f66219e6c
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.558 × 10⁹⁷(98-digit number)
55582826568825974807…49106648280986015921
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.558 × 10⁹⁷(98-digit number)
55582826568825974807…49106648280986015921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.111 × 10⁹⁸(99-digit number)
11116565313765194961…98213296561972031841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.223 × 10⁹⁸(99-digit number)
22233130627530389923…96426593123944063681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.446 × 10⁹⁸(99-digit number)
44466261255060779846…92853186247888127361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.893 × 10⁹⁸(99-digit number)
88932522510121559692…85706372495776254721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.778 × 10⁹⁹(100-digit number)
17786504502024311938…71412744991552509441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.557 × 10⁹⁹(100-digit number)
35573009004048623877…42825489983105018881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.114 × 10⁹⁹(100-digit number)
71146018008097247754…85650979966210037761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.422 × 10¹⁰⁰(101-digit number)
14229203601619449550…71301959932420075521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.845 × 10¹⁰⁰(101-digit number)
28458407203238899101…42603919864840151041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.691 × 10¹⁰⁰(101-digit number)
56916814406477798203…85207839729680302081
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,717,042 XPM·at block #6,809,122 · 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