Block #891,402

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2015, 7:17:17 PM · Difficulty 10.9532 · 5,933,161 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a0e5c7db48c0a6820775a42cc62c189e5d50bafbca74141d57755db0f83c7cf0

Height

#891,402

Difficulty

10.953233

Transactions

9

Size

2.69 KB

Version

2

Bits

0af4071c

Nonce

514,021,694

Timestamp

1/11/2015, 7:17:17 PM

Confirmations

5,933,161

Merkle Root

4b869766aaa294ee716e45e8682da726daed659fc9d96f2731778ee1245cd1fd
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.140 × 10⁹⁴(95-digit number)
71407794576633204844…15279202832295476161
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.140 × 10⁹⁴(95-digit number)
71407794576633204844…15279202832295476161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.428 × 10⁹⁵(96-digit number)
14281558915326640968…30558405664590952321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.856 × 10⁹⁵(96-digit number)
28563117830653281937…61116811329181904641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.712 × 10⁹⁵(96-digit number)
57126235661306563875…22233622658363809281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.142 × 10⁹⁶(97-digit number)
11425247132261312775…44467245316727618561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.285 × 10⁹⁶(97-digit number)
22850494264522625550…88934490633455237121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.570 × 10⁹⁶(97-digit number)
45700988529045251100…77868981266910474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.140 × 10⁹⁶(97-digit number)
91401977058090502201…55737962533820948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.828 × 10⁹⁷(98-digit number)
18280395411618100440…11475925067641896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.656 × 10⁹⁷(98-digit number)
36560790823236200880…22951850135283793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.312 × 10⁹⁷(98-digit number)
73121581646472401760…45903700270567587841
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,840,569 XPM·at block #6,824,562 · 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