Block #1,585,944

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2016, 5:42:33 PM · Difficulty 10.6491 · 5,245,642 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8b8d60498fd8d48666977d4d223dd7488cfcb9c8ab4349eb401049572b983489

Height

#1,585,944

Difficulty

10.649093

Transactions

2

Size

1.14 KB

Version

2

Bits

0aa62af5

Nonce

27,958,223

Timestamp

5/15/2016, 5:42:33 PM

Confirmations

5,245,642

Merkle Root

31f9b65ae0064902bcfa32bc43192052c56eae11b27598fb2cd72775161e6579
Transactions (2)
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.853 × 10⁹⁴(95-digit number)
18537593860899812319…09365878676479896121
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.853 × 10⁹⁴(95-digit number)
18537593860899812319…09365878676479896121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.707 × 10⁹⁴(95-digit number)
37075187721799624638…18731757352959792241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.415 × 10⁹⁴(95-digit number)
74150375443599249277…37463514705919584481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.483 × 10⁹⁵(96-digit number)
14830075088719849855…74927029411839168961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.966 × 10⁹⁵(96-digit number)
29660150177439699711…49854058823678337921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.932 × 10⁹⁵(96-digit number)
59320300354879399422…99708117647356675841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.186 × 10⁹⁶(97-digit number)
11864060070975879884…99416235294713351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.372 × 10⁹⁶(97-digit number)
23728120141951759768…98832470589426703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.745 × 10⁹⁶(97-digit number)
47456240283903519537…97664941178853406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.491 × 10⁹⁶(97-digit number)
94912480567807039075…95329882357706813441
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,896,784 XPM·at block #6,831,585 · 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