Block #592,585

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/18/2014, 12:02:33 AM · Difficulty 10.9425 · 6,216,752 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a7a7c0133ee8e9e43e3ffdb7586c037913af8a0dbd7849e45fef5e5aa352a366

Height

#592,585

Difficulty

10.942529

Transactions

5

Size

1.23 KB

Version

2

Bits

0af14995

Nonce

973,193,478

Timestamp

6/18/2014, 12:02:33 AM

Confirmations

6,216,752

Merkle Root

cd2242b324e43fe768dbd4c0b54961c7bf33bbbbd449447cca14a0b2de003fe1
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.589 × 10⁹⁷(98-digit number)
35896843639172052761…91671751150772122241
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.589 × 10⁹⁷(98-digit number)
35896843639172052761…91671751150772122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.179 × 10⁹⁷(98-digit number)
71793687278344105523…83343502301544244481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.435 × 10⁹⁸(99-digit number)
14358737455668821104…66687004603088488961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.871 × 10⁹⁸(99-digit number)
28717474911337642209…33374009206176977921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.743 × 10⁹⁸(99-digit number)
57434949822675284418…66748018412353955841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.148 × 10⁹⁹(100-digit number)
11486989964535056883…33496036824707911681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.297 × 10⁹⁹(100-digit number)
22973979929070113767…66992073649415823361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.594 × 10⁹⁹(100-digit number)
45947959858140227535…33984147298831646721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.189 × 10⁹⁹(100-digit number)
91895919716280455070…67968294597663293441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.837 × 10¹⁰⁰(101-digit number)
18379183943256091014…35936589195326586881
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,718,761 XPM·at block #6,809,336 · 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