Block #1,581,134

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/12/2016, 5:18:06 AM · Difficulty 10.6661 · 5,235,173 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6b671143c225dce88a06a4fcf1af92574fc45c85f660ffe49602942ddd16df9

Height

#1,581,134

Difficulty

10.666123

Transactions

5

Size

4.00 KB

Version

2

Bits

0aaa8709

Nonce

583,382,520

Timestamp

5/12/2016, 5:18:06 AM

Confirmations

5,235,173

Merkle Root

edf92cd327ce1995caaa949460a1897f789731169f1f78be58f0283441eb2045
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.714 × 10⁹⁵(96-digit number)
17145553340477311225…55521753022293416961
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.714 × 10⁹⁵(96-digit number)
17145553340477311225…55521753022293416961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.429 × 10⁹⁵(96-digit number)
34291106680954622450…11043506044586833921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.858 × 10⁹⁵(96-digit number)
68582213361909244901…22087012089173667841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.371 × 10⁹⁶(97-digit number)
13716442672381848980…44174024178347335681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.743 × 10⁹⁶(97-digit number)
27432885344763697960…88348048356694671361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.486 × 10⁹⁶(97-digit number)
54865770689527395920…76696096713389342721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.097 × 10⁹⁷(98-digit number)
10973154137905479184…53392193426778685441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.194 × 10⁹⁷(98-digit number)
21946308275810958368…06784386853557370881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.389 × 10⁹⁷(98-digit number)
43892616551621916736…13568773707114741761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.778 × 10⁹⁷(98-digit number)
87785233103243833473…27137547414229483521
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,774,576 XPM·at block #6,816,306 · 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