Block #519,203

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 2:21:02 AM · Difficulty 10.8551 · 6,298,571 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5a89ab05ffd3ec604b91eabc3b150b62ebcf94de87e1c1c126f5fe2a979fed7c

Height

#519,203

Difficulty

10.855098

Transactions

6

Size

1.45 KB

Version

2

Bits

0adae7b5

Nonce

43,604,019

Timestamp

5/1/2014, 2:21:02 AM

Confirmations

6,298,571

Merkle Root

6effb3ed97123677a008e43961a714350825c71d68bac35b56cde3762036d826
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.819 × 10⁹⁸(99-digit number)
18190232412510967257…51127975101512010501
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.819 × 10⁹⁸(99-digit number)
18190232412510967257…51127975101512010501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.638 × 10⁹⁸(99-digit number)
36380464825021934514…02255950203024021001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.276 × 10⁹⁸(99-digit number)
72760929650043869028…04511900406048042001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.455 × 10⁹⁹(100-digit number)
14552185930008773805…09023800812096084001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.910 × 10⁹⁹(100-digit number)
29104371860017547611…18047601624192168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.820 × 10⁹⁹(100-digit number)
58208743720035095222…36095203248384336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.164 × 10¹⁰⁰(101-digit number)
11641748744007019044…72190406496768672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.328 × 10¹⁰⁰(101-digit number)
23283497488014038089…44380812993537344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.656 × 10¹⁰⁰(101-digit number)
46566994976028076178…88761625987074688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.313 × 10¹⁰⁰(101-digit number)
93133989952056152356…77523251974149376001
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,786,250 XPM·at block #6,817,773 · 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