Block #528,444

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2014, 3:45:20 PM · Difficulty 10.8870 · 6,278,177 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cd1483d1f0642ee3f944a195e13b6d6cd30e6ec1a41a2f9ac238ffa6f04cf798

Height

#528,444

Difficulty

10.887035

Transactions

7

Size

1.50 KB

Version

2

Bits

0ae314bf

Nonce

93,988,166

Timestamp

5/6/2014, 3:45:20 PM

Confirmations

6,278,177

Merkle Root

a8fc9c808b5fb03fd398409ffd2ac478c25210fdef027424ce58160cb03bd1b8
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.916 × 10⁹⁸(99-digit number)
19162936827830099991…50823138528121627611
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.916 × 10⁹⁸(99-digit number)
19162936827830099991…50823138528121627611
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.832 × 10⁹⁸(99-digit number)
38325873655660199982…01646277056243255221
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.665 × 10⁹⁸(99-digit number)
76651747311320399965…03292554112486510441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.533 × 10⁹⁹(100-digit number)
15330349462264079993…06585108224973020881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.066 × 10⁹⁹(100-digit number)
30660698924528159986…13170216449946041761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.132 × 10⁹⁹(100-digit number)
61321397849056319972…26340432899892083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.226 × 10¹⁰⁰(101-digit number)
12264279569811263994…52680865799784167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.452 × 10¹⁰⁰(101-digit number)
24528559139622527989…05361731599568334081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.905 × 10¹⁰⁰(101-digit number)
49057118279245055978…10723463199136668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.811 × 10¹⁰⁰(101-digit number)
98114236558490111956…21446926398273336321
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,697,068 XPM·at block #6,806,620 · 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