Block #521,767

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2014, 4:04:19 PM · Difficulty 10.8636 · 6,290,927 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e9f8a7f3a9e479a44cad133806bd6f967ee77dac8b7b99ddcfa7e23dfef6f4f

Height

#521,767

Difficulty

10.863604

Transactions

3

Size

653 B

Version

2

Bits

0add151f

Nonce

419,481,643

Timestamp

5/2/2014, 4:04:19 PM

Confirmations

6,290,927

Merkle Root

2fed290a5b07675d01ef5f829f5a4e3feae07619aeda101dabded21e50d0c61a
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.764 × 10⁹⁸(99-digit number)
17648142504058890558…61115380459695508881
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.764 × 10⁹⁸(99-digit number)
17648142504058890558…61115380459695508881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.529 × 10⁹⁸(99-digit number)
35296285008117781117…22230760919391017761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.059 × 10⁹⁸(99-digit number)
70592570016235562234…44461521838782035521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.411 × 10⁹⁹(100-digit number)
14118514003247112446…88923043677564071041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.823 × 10⁹⁹(100-digit number)
28237028006494224893…77846087355128142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.647 × 10⁹⁹(100-digit number)
56474056012988449787…55692174710256284161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.129 × 10¹⁰⁰(101-digit number)
11294811202597689957…11384349420512568321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.258 × 10¹⁰⁰(101-digit number)
22589622405195379914…22768698841025136641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.517 × 10¹⁰⁰(101-digit number)
45179244810390759829…45537397682050273281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.035 × 10¹⁰⁰(101-digit number)
90358489620781519659…91074795364100546561
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,745,588 XPM·at block #6,812,693 · 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