Block #1,543,556

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2016, 6:05:58 AM · Difficulty 10.6518 · 5,283,003 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cd513d76c4d4fad33ecd539df5c6d4097636a2d49b1f45c04909c68554838974

Height

#1,543,556

Difficulty

10.651755

Transactions

2

Size

1.01 KB

Version

2

Bits

0aa6d96d

Nonce

476,855,642

Timestamp

4/16/2016, 6:05:58 AM

Confirmations

5,283,003

Merkle Root

385a115ed735c0b3bf53dc6186d297a1435b294065de9847a0cc4616ed8d2d1b
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.628 × 10⁹³(94-digit number)
36289965132645673454…80314960644808844281
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.628 × 10⁹³(94-digit number)
36289965132645673454…80314960644808844281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.257 × 10⁹³(94-digit number)
72579930265291346909…60629921289617688561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.451 × 10⁹⁴(95-digit number)
14515986053058269381…21259842579235377121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.903 × 10⁹⁴(95-digit number)
29031972106116538763…42519685158470754241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.806 × 10⁹⁴(95-digit number)
58063944212233077527…85039370316941508481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.161 × 10⁹⁵(96-digit number)
11612788842446615505…70078740633883016961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.322 × 10⁹⁵(96-digit number)
23225577684893231010…40157481267766033921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.645 × 10⁹⁵(96-digit number)
46451155369786462021…80314962535532067841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.290 × 10⁹⁵(96-digit number)
92902310739572924043…60629925071064135681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.858 × 10⁹⁶(97-digit number)
18580462147914584808…21259850142128271361
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,856,623 XPM·at block #6,826,558 · 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