Block #512,477

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/26/2014, 9:24:01 PM · Difficulty 10.8341 · 6,295,240 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
707e463fd88ae2baf15e3340036e842a227a782c0cc89531ff682f18c386463e

Height

#512,477

Difficulty

10.834110

Transactions

9

Size

2.55 KB

Version

2

Bits

0ad5883c

Nonce

18,952,435

Timestamp

4/26/2014, 9:24:01 PM

Confirmations

6,295,240

Merkle Root

90be27f48688ec29869345c1ad42504280a7829cd52163c3d7f7715bb0e83fe0
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.254 × 10⁹⁸(99-digit number)
72545781547127316866…50508231416609408001
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.254 × 10⁹⁸(99-digit number)
72545781547127316866…50508231416609408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.450 × 10⁹⁹(100-digit number)
14509156309425463373…01016462833218816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.901 × 10⁹⁹(100-digit number)
29018312618850926746…02032925666437632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.803 × 10⁹⁹(100-digit number)
58036625237701853493…04065851332875264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.160 × 10¹⁰⁰(101-digit number)
11607325047540370698…08131702665750528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.321 × 10¹⁰⁰(101-digit number)
23214650095080741397…16263405331501056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.642 × 10¹⁰⁰(101-digit number)
46429300190161482794…32526810663002112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.285 × 10¹⁰⁰(101-digit number)
92858600380322965589…65053621326004224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.857 × 10¹⁰¹(102-digit number)
18571720076064593117…30107242652008448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.714 × 10¹⁰¹(102-digit number)
37143440152129186235…60214485304016896001
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,705,769 XPM·at block #6,807,716 · 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