Block #519,503

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 6:50:17 AM · Difficulty 10.8560 · 6,290,565 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e109e64f8e7ea68c2abb0fddf74362205b551642aea444ac8bed2b7b1866613

Height

#519,503

Difficulty

10.855977

Transactions

5

Size

1.09 KB

Version

2

Bits

0adb2148

Nonce

21,379,916

Timestamp

5/1/2014, 6:50:17 AM

Confirmations

6,290,565

Merkle Root

77e52da868b41e91964385f9f56aa57a9905916188f1c13744d4d5f5d95121da
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.184 × 10⁹⁸(99-digit number)
11841417376332614832…63213545810394624241
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.184 × 10⁹⁸(99-digit number)
11841417376332614832…63213545810394624241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.368 × 10⁹⁸(99-digit number)
23682834752665229664…26427091620789248481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.736 × 10⁹⁸(99-digit number)
47365669505330459329…52854183241578496961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.473 × 10⁹⁸(99-digit number)
94731339010660918658…05708366483156993921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.894 × 10⁹⁹(100-digit number)
18946267802132183731…11416732966313987841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.789 × 10⁹⁹(100-digit number)
37892535604264367463…22833465932627975681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.578 × 10⁹⁹(100-digit number)
75785071208528734926…45666931865255951361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.515 × 10¹⁰⁰(101-digit number)
15157014241705746985…91333863730511902721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.031 × 10¹⁰⁰(101-digit number)
30314028483411493970…82667727461023805441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.062 × 10¹⁰⁰(101-digit number)
60628056966822987941…65335454922047610881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.212 × 10¹⁰¹(102-digit number)
12125611393364597588…30670909844095221761
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,724,616 XPM·at block #6,810,067 · 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