Block #1,534,572

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 8:17:32 AM · Difficulty 10.6171 · 5,282,020 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff8b50374ae9a8de45d0fe3dd65c1e35efb3dbecc4c8d8ac6606a3621a3cb19a

Height

#1,534,572

Difficulty

10.617071

Transactions

4

Size

22.43 KB

Version

2

Bits

0a9df858

Nonce

316,798,556

Timestamp

4/10/2016, 8:17:32 AM

Confirmations

5,282,020

Merkle Root

a89ea8c1d59f317fdbfadfaf260ed7b2d2b6e72c695b48440cce6e249be7d895
Transactions (4)
1 in → 1 out9.1000 XPM110 B
51 in → 1 out2885.9426 XPM7.41 KB
51 in → 1 out1199.6893 XPM7.41 KB
51 in → 1 out607.6865 XPM7.41 KB
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.

2.238 × 10⁹⁶(97-digit number)
22387454239259099684…10170608383344660481
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
2.238 × 10⁹⁶(97-digit number)
22387454239259099684…10170608383344660481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.477 × 10⁹⁶(97-digit number)
44774908478518199368…20341216766689320961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.954 × 10⁹⁶(97-digit number)
89549816957036398736…40682433533378641921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.790 × 10⁹⁷(98-digit number)
17909963391407279747…81364867066757283841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.581 × 10⁹⁷(98-digit number)
35819926782814559494…62729734133514567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.163 × 10⁹⁷(98-digit number)
71639853565629118988…25459468267029135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.432 × 10⁹⁸(99-digit number)
14327970713125823797…50918936534058270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.865 × 10⁹⁸(99-digit number)
28655941426251647595…01837873068116541441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.731 × 10⁹⁸(99-digit number)
57311882852503295191…03675746136233082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.146 × 10⁹⁹(100-digit number)
11462376570500659038…07351492272466165761
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,860 XPM·at block #6,816,591 · 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