Block #840,582

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2014, 6:28:57 AM · Difficulty 10.9742 · 5,968,899 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
620435e26e3be91cda6abe067cda52d37d27608e765fd70aa415c096de8a0fd7

Height

#840,582

Difficulty

10.974223

Transactions

9

Size

1.96 KB

Version

2

Bits

0af966a9

Nonce

77,381,667

Timestamp

12/5/2014, 6:28:57 AM

Confirmations

5,968,899

Merkle Root

3997c0cd29c7eccc6a82864c7a14945333b5f3a355f125a78433364a06a0d160
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.

7.463 × 10⁹⁴(95-digit number)
74639693054229301228…16917989686890538681
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
7.463 × 10⁹⁴(95-digit number)
74639693054229301228…16917989686890538681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.492 × 10⁹⁵(96-digit number)
14927938610845860245…33835979373781077361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.985 × 10⁹⁵(96-digit number)
29855877221691720491…67671958747562154721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.971 × 10⁹⁵(96-digit number)
59711754443383440982…35343917495124309441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.194 × 10⁹⁶(97-digit number)
11942350888676688196…70687834990248618881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.388 × 10⁹⁶(97-digit number)
23884701777353376393…41375669980497237761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.776 × 10⁹⁶(97-digit number)
47769403554706752786…82751339960994475521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.553 × 10⁹⁶(97-digit number)
95538807109413505572…65502679921988951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.910 × 10⁹⁷(98-digit number)
19107761421882701114…31005359843977902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.821 × 10⁹⁷(98-digit number)
38215522843765402228…62010719687955804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.643 × 10⁹⁷(98-digit number)
76431045687530804457…24021439375911608321
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,719,919 XPM·at block #6,809,480 · 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