Block #857,697

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 12:48:15 AM · Difficulty 10.9675 · 5,985,515 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c9c4fba2a9071b5c99e65f90b54ce57890b49a18d5d1055021e0605fff113765

Height

#857,697

Difficulty

10.967472

Transactions

14

Size

3.78 KB

Version

2

Bits

0af7ac47

Nonce

85,339,185

Timestamp

12/18/2014, 12:48:15 AM

Confirmations

5,985,515

Merkle Root

696b15a35b56703c47ade8990c830a7b66adb4df5bb60c1b35edeef1d0c00774
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.214 × 10⁹⁴(95-digit number)
32147762046786572708…55686379930506252481
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.214 × 10⁹⁴(95-digit number)
32147762046786572708…55686379930506252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.429 × 10⁹⁴(95-digit number)
64295524093573145416…11372759861012504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.285 × 10⁹⁵(96-digit number)
12859104818714629083…22745519722025009921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.571 × 10⁹⁵(96-digit number)
25718209637429258166…45491039444050019841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.143 × 10⁹⁵(96-digit number)
51436419274858516333…90982078888100039681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.028 × 10⁹⁶(97-digit number)
10287283854971703266…81964157776200079361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.057 × 10⁹⁶(97-digit number)
20574567709943406533…63928315552400158721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.114 × 10⁹⁶(97-digit number)
41149135419886813066…27856631104800317441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.229 × 10⁹⁶(97-digit number)
82298270839773626133…55713262209600634881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.645 × 10⁹⁷(98-digit number)
16459654167954725226…11426524419201269761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.291 × 10⁹⁷(98-digit number)
32919308335909450453…22853048838402539521
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,990,069 XPM·at block #6,843,211 · 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