Block #1,540,848

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2016, 10:32:52 AM · Difficulty 10.6450 · 5,276,426 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c95205b7b7c8be12b88c2547eaffcb7ce80066f1ae828a03aa6436ba5e36382

Height

#1,540,848

Difficulty

10.644971

Transactions

2

Size

2.29 KB

Version

2

Bits

0aa51cd3

Nonce

547,385,059

Timestamp

4/14/2016, 10:32:52 AM

Confirmations

5,276,426

Merkle Root

d260222e73cb463aac4557aa38b19255151a584e4bb9a0c46d464f7ea1eacd92
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.

3.310 × 10⁹³(94-digit number)
33108871401799814109…23544931529161953281
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
3.310 × 10⁹³(94-digit number)
33108871401799814109…23544931529161953281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.621 × 10⁹³(94-digit number)
66217742803599628219…47089863058323906561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.324 × 10⁹⁴(95-digit number)
13243548560719925643…94179726116647813121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.648 × 10⁹⁴(95-digit number)
26487097121439851287…88359452233295626241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.297 × 10⁹⁴(95-digit number)
52974194242879702575…76718904466591252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.059 × 10⁹⁵(96-digit number)
10594838848575940515…53437808933182504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.118 × 10⁹⁵(96-digit number)
21189677697151881030…06875617866365009921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.237 × 10⁹⁵(96-digit number)
42379355394303762060…13751235732730019841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.475 × 10⁹⁵(96-digit number)
84758710788607524120…27502471465460039681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.695 × 10⁹⁶(97-digit number)
16951742157721504824…55004942930920079361
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,782,230 XPM·at block #6,817,273 · 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