Block #853,606

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2014, 12:24:11 AM · Difficulty 10.9689 · 5,989,656 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb003f6b4c66affac64429102552dbd9375b86cecf4ffd774b0ab8043e1fc669

Height

#853,606

Difficulty

10.968933

Transactions

3

Size

616 B

Version

2

Bits

0af80c05

Nonce

150,814,015

Timestamp

12/15/2014, 12:24:11 AM

Confirmations

5,989,656

Merkle Root

e923f915a179acba393cb541261a693cff77c7c33a97715b88c6bccb3a7cef31
Transactions (3)
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.098 × 10⁹⁴(95-digit number)
10980207735356385148…07148059786326009701
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.098 × 10⁹⁴(95-digit number)
10980207735356385148…07148059786326009701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.196 × 10⁹⁴(95-digit number)
21960415470712770296…14296119572652019401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.392 × 10⁹⁴(95-digit number)
43920830941425540593…28592239145304038801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.784 × 10⁹⁴(95-digit number)
87841661882851081186…57184478290608077601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.756 × 10⁹⁵(96-digit number)
17568332376570216237…14368956581216155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.513 × 10⁹⁵(96-digit number)
35136664753140432474…28737913162432310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.027 × 10⁹⁵(96-digit number)
70273329506280864948…57475826324864620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.405 × 10⁹⁶(97-digit number)
14054665901256172989…14951652649729241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.810 × 10⁹⁶(97-digit number)
28109331802512345979…29903305299458483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.621 × 10⁹⁶(97-digit number)
56218663605024691959…59806610598916966401
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,990,469 XPM·at block #6,843,261 · 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