Block #1,572,343

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/5/2016, 9:07:28 AM · Difficulty 10.7291 · 5,244,879 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b1d15f3a7beeab7102fff5b01551c9c1bb15176d4922c27498477387f2fa56a2

Height

#1,572,343

Difficulty

10.729073

Transactions

32

Size

11.26 KB

Version

2

Bits

0abaa48c

Nonce

200,942,959

Timestamp

5/5/2016, 9:07:28 AM

Confirmations

5,244,879

Merkle Root

4c5d6876b6183b429b1f8a85645b805cec8447d82362d24e50905027c8ad2f76
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.198 × 10⁹⁴(95-digit number)
11986161927079260312…10506274750871973751
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.198 × 10⁹⁴(95-digit number)
11986161927079260312…10506274750871973751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.397 × 10⁹⁴(95-digit number)
23972323854158520625…21012549501743947501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.794 × 10⁹⁴(95-digit number)
47944647708317041250…42025099003487895001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.588 × 10⁹⁴(95-digit number)
95889295416634082501…84050198006975790001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.917 × 10⁹⁵(96-digit number)
19177859083326816500…68100396013951580001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.835 × 10⁹⁵(96-digit number)
38355718166653633000…36200792027903160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.671 × 10⁹⁵(96-digit number)
76711436333307266000…72401584055806320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.534 × 10⁹⁶(97-digit number)
15342287266661453200…44803168111612640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.068 × 10⁹⁶(97-digit number)
30684574533322906400…89606336223225280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.136 × 10⁹⁶(97-digit number)
61369149066645812800…79212672446450560001
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,781,815 XPM·at block #6,817,221 · 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