Block #839,613

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2014, 1:11:50 PM · Difficulty 10.9745 · 6,003,131 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
259b52477724d961a387f73a707964a0da23cfdcbdee6be013982adbf9daa5b2

Height

#839,613

Difficulty

10.974535

Transactions

2

Size

433 B

Version

2

Bits

0af97b1c

Nonce

594,435,257

Timestamp

12/4/2014, 1:11:50 PM

Confirmations

6,003,131

Merkle Root

2c30a3f538f529133caa08344ec5c8245402e565ee531d4502b2321525fa3b09
Transactions (2)
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.064 × 10⁹⁶(97-digit number)
50648411242265715810…25276754225244956161
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.064 × 10⁹⁶(97-digit number)
50648411242265715810…25276754225244956161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.012 × 10⁹⁷(98-digit number)
10129682248453143162…50553508450489912321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.025 × 10⁹⁷(98-digit number)
20259364496906286324…01107016900979824641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.051 × 10⁹⁷(98-digit number)
40518728993812572648…02214033801959649281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.103 × 10⁹⁷(98-digit number)
81037457987625145296…04428067603919298561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.620 × 10⁹⁸(99-digit number)
16207491597525029059…08856135207838597121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.241 × 10⁹⁸(99-digit number)
32414983195050058118…17712270415677194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.482 × 10⁹⁸(99-digit number)
64829966390100116237…35424540831354388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.296 × 10⁹⁹(100-digit number)
12965993278020023247…70849081662708776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.593 × 10⁹⁹(100-digit number)
25931986556040046494…41698163325417553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.186 × 10⁹⁹(100-digit number)
51863973112080092989…83396326650835107841
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,986,288 XPM·at block #6,842,743 · 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