Block #516,170

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 5:12:17 AM · Difficulty 10.8453 · 6,294,322 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cbf48585e4b97fc174f53dd09af773a134f2f60d84c7007304c7e5a6acf23f50

Height

#516,170

Difficulty

10.845311

Transactions

13

Size

3.72 KB

Version

2

Bits

0ad86645

Nonce

527,034,359

Timestamp

4/29/2014, 5:12:17 AM

Confirmations

6,294,322

Merkle Root

573d579ca503093800354b59c4e32de12500d709b85108b1abfc54670c8f5548
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.

5.719 × 10⁹⁷(98-digit number)
57191102870062968328…10737463615263172001
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
5.719 × 10⁹⁷(98-digit number)
57191102870062968328…10737463615263172001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.143 × 10⁹⁸(99-digit number)
11438220574012593665…21474927230526344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.287 × 10⁹⁸(99-digit number)
22876441148025187331…42949854461052688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.575 × 10⁹⁸(99-digit number)
45752882296050374663…85899708922105376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.150 × 10⁹⁸(99-digit number)
91505764592100749326…71799417844210752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.830 × 10⁹⁹(100-digit number)
18301152918420149865…43598835688421504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.660 × 10⁹⁹(100-digit number)
36602305836840299730…87197671376843008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.320 × 10⁹⁹(100-digit number)
73204611673680599461…74395342753686016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.464 × 10¹⁰⁰(101-digit number)
14640922334736119892…48790685507372032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.928 × 10¹⁰⁰(101-digit number)
29281844669472239784…97581371014744064001
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,728,017 XPM·at block #6,810,491 · 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.

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