Block #587,753

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/14/2014, 2:15:45 AM · Difficulty 10.9508 · 6,222,486 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b355addaab2b4382bddff9bb7286843313ee84d6ceac9c2b4934fff13f1f3152

Height

#587,753

Difficulty

10.950761

Transactions

6

Size

3.76 KB

Version

2

Bits

0af36519

Nonce

43,202,397

Timestamp

6/14/2014, 2:15:45 AM

Confirmations

6,222,486

Merkle Root

dafd82943e9553200ce953f8bbc57ea905464130331f6fc23441a0cb0dc1f24c
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.

1.658 × 10⁹⁷(98-digit number)
16582347909179866671…35011599459733613841
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
1.658 × 10⁹⁷(98-digit number)
16582347909179866671…35011599459733613841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.316 × 10⁹⁷(98-digit number)
33164695818359733343…70023198919467227681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.632 × 10⁹⁷(98-digit number)
66329391636719466687…40046397838934455361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.326 × 10⁹⁸(99-digit number)
13265878327343893337…80092795677868910721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.653 × 10⁹⁸(99-digit number)
26531756654687786674…60185591355737821441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.306 × 10⁹⁸(99-digit number)
53063513309375573349…20371182711475642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.061 × 10⁹⁹(100-digit number)
10612702661875114669…40742365422951285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.122 × 10⁹⁹(100-digit number)
21225405323750229339…81484730845902571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.245 × 10⁹⁹(100-digit number)
42450810647500458679…62969461691805143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.490 × 10⁹⁹(100-digit number)
84901621295000917359…25938923383610286081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,725,990 XPM·at block #6,810,238 · 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