Block #517,267

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 8:35:48 PM · Difficulty 10.8506 · 6,324,625 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4f56d9ff2de50228bff475989a663b00a55031738e19fb5545ba99ccac82f94f

Height

#517,267

Difficulty

10.850608

Transactions

3

Size

1.71 KB

Version

2

Bits

0ad9c173

Nonce

129,687

Timestamp

4/29/2014, 8:35:48 PM

Confirmations

6,324,625

Merkle Root

64df9b36b98614eefeb7ad4d06002ade02997881f2c3b39a3ac9cbe840f42be9
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.824 × 10¹⁰⁴(105-digit number)
28241713904118727710…68009653439427491841
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.824 × 10¹⁰⁴(105-digit number)
28241713904118727710…68009653439427491841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.648 × 10¹⁰⁴(105-digit number)
56483427808237455421…36019306878854983681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.129 × 10¹⁰⁵(106-digit number)
11296685561647491084…72038613757709967361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.259 × 10¹⁰⁵(106-digit number)
22593371123294982168…44077227515419934721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.518 × 10¹⁰⁵(106-digit number)
45186742246589964337…88154455030839869441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.037 × 10¹⁰⁵(106-digit number)
90373484493179928674…76308910061679738881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.807 × 10¹⁰⁶(107-digit number)
18074696898635985734…52617820123359477761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.614 × 10¹⁰⁶(107-digit number)
36149393797271971469…05235640246718955521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.229 × 10¹⁰⁶(107-digit number)
72298787594543942939…10471280493437911041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.445 × 10¹⁰⁷(108-digit number)
14459757518908788587…20942560986875822081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.891 × 10¹⁰⁷(108-digit number)
28919515037817577175…41885121973751644161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,979,512 XPM·at block #6,841,891 · 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