Block #850,140

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2014, 7:34:34 AM · Difficulty 10.9713 · 5,988,996 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ea575dda05bde5a7b54c826e14126d9fa54bb919821814b9cf630b689ca89cc

Height

#850,140

Difficulty

10.971333

Transactions

19

Size

4.69 KB

Version

2

Bits

0af8a94e

Nonce

1,449,736,687

Timestamp

12/12/2014, 7:34:34 AM

Confirmations

5,988,996

Merkle Root

d659f093a2676983f96c0037c36985edc1c0ec8f9de655143e83145961107d63
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.464 × 10⁹⁶(97-digit number)
14644235783102505203…72371113399372157441
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.464 × 10⁹⁶(97-digit number)
14644235783102505203…72371113399372157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.928 × 10⁹⁶(97-digit number)
29288471566205010407…44742226798744314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.857 × 10⁹⁶(97-digit number)
58576943132410020814…89484453597488629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.171 × 10⁹⁷(98-digit number)
11715388626482004162…78968907194977259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.343 × 10⁹⁷(98-digit number)
23430777252964008325…57937814389954519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.686 × 10⁹⁷(98-digit number)
46861554505928016651…15875628779909038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.372 × 10⁹⁷(98-digit number)
93723109011856033303…31751257559818076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.874 × 10⁹⁸(99-digit number)
18744621802371206660…63502515119636152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.748 × 10⁹⁸(99-digit number)
37489243604742413321…27005030239272304641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.497 × 10⁹⁸(99-digit number)
74978487209484826642…54010060478544609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.499 × 10⁹⁹(100-digit number)
14995697441896965328…08020120957089218561
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,957,366 XPM·at block #6,839,135 · 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