Block #1,528,533

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2016, 5:04:55 AM · Difficulty 10.6098 · 5,288,000 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e8d4708613187e8ab18a2d69441b39ef386d9ebf68766f7ccc8518a84c240dd

Height

#1,528,533

Difficulty

10.609761

Transactions

2

Size

1019 B

Version

2

Bits

0a9c1953

Nonce

229,935,092

Timestamp

4/6/2016, 5:04:55 AM

Confirmations

5,288,000

Merkle Root

57f8340cb7861e40d38d40db8c3e2a972ed962970435e1623d5db52ec771ff0c
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.940 × 10⁹⁵(96-digit number)
39401683327288262931…61157489140227253761
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.940 × 10⁹⁵(96-digit number)
39401683327288262931…61157489140227253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.880 × 10⁹⁵(96-digit number)
78803366654576525863…22314978280454507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.576 × 10⁹⁶(97-digit number)
15760673330915305172…44629956560909015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.152 × 10⁹⁶(97-digit number)
31521346661830610345…89259913121818030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.304 × 10⁹⁶(97-digit number)
63042693323661220690…78519826243636060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.260 × 10⁹⁷(98-digit number)
12608538664732244138…57039652487272120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.521 × 10⁹⁷(98-digit number)
25217077329464488276…14079304974544240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.043 × 10⁹⁷(98-digit number)
50434154658928976552…28158609949088481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.008 × 10⁹⁸(99-digit number)
10086830931785795310…56317219898176962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.017 × 10⁹⁸(99-digit number)
20173661863571590620…12634439796353925121
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,776,391 XPM·at block #6,816,532 · 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