Block #520,900

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2014, 3:31:20 AM · Difficulty 10.8604 · 6,285,385 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a578005c67b222c35b746f0c3819bcd9dc24b53094164af38530199a3c6e430f

Height

#520,900

Difficulty

10.860435

Transactions

5

Size

1.07 KB

Version

2

Bits

0adc4572

Nonce

1,087,614

Timestamp

5/2/2014, 3:31:20 AM

Confirmations

6,285,385

Merkle Root

f1a1397579b0dff0e2edbc312be36e82a04294103185eab5426d7af6ecd6de78
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.

7.099 × 10⁹³(94-digit number)
70999532739695275496…05152571099734900481
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
7.099 × 10⁹³(94-digit number)
70999532739695275496…05152571099734900481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.419 × 10⁹⁴(95-digit number)
14199906547939055099…10305142199469800961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.839 × 10⁹⁴(95-digit number)
28399813095878110198…20610284398939601921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.679 × 10⁹⁴(95-digit number)
56799626191756220397…41220568797879203841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.135 × 10⁹⁵(96-digit number)
11359925238351244079…82441137595758407681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.271 × 10⁹⁵(96-digit number)
22719850476702488158…64882275191516815361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.543 × 10⁹⁵(96-digit number)
45439700953404976317…29764550383033630721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.087 × 10⁹⁵(96-digit number)
90879401906809952635…59529100766067261441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.817 × 10⁹⁶(97-digit number)
18175880381361990527…19058201532134522881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.635 × 10⁹⁶(97-digit number)
36351760762723981054…38116403064269045761
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,694,366 XPM·at block #6,806,284 · 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