Block #1,584,771

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/14/2016, 10:06:44 PM · Difficulty 10.6493 · 5,258,255 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5910df124d7dfabafbaa556dcb6abf7c7f3c0b7f383a5c4cb199ae64c4e925ee

Height

#1,584,771

Difficulty

10.649310

Transactions

2

Size

800 B

Version

2

Bits

0aa63936

Nonce

1,030,600,198

Timestamp

5/14/2016, 10:06:44 PM

Confirmations

5,258,255

Merkle Root

2bede58b7dad4d6d754f6d53ae57f45cf3cf0644493653e59d3075384e91473b
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.658 × 10⁹⁶(97-digit number)
16584447504211701733…68233181879774740481
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.658 × 10⁹⁶(97-digit number)
16584447504211701733…68233181879774740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.316 × 10⁹⁶(97-digit number)
33168895008423403467…36466363759549480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.633 × 10⁹⁶(97-digit number)
66337790016846806935…72932727519098961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.326 × 10⁹⁷(98-digit number)
13267558003369361387…45865455038197923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.653 × 10⁹⁷(98-digit number)
26535116006738722774…91730910076395847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.307 × 10⁹⁷(98-digit number)
53070232013477445548…83461820152791695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.061 × 10⁹⁸(99-digit number)
10614046402695489109…66923640305583390721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.122 × 10⁹⁸(99-digit number)
21228092805390978219…33847280611166781441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.245 × 10⁹⁸(99-digit number)
42456185610781956438…67694561222333562881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.491 × 10⁹⁸(99-digit number)
84912371221563912877…35389122444667125761
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,988,562 XPM·at block #6,843,025 · 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