Block #509,714

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/25/2014, 5:38:07 AM · Difficulty 10.8211 · 6,304,754 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
274e7d0b099ea2664ec0cf6363c7e8484ebff3afcca82394702d457715030eaf

Height

#509,714

Difficulty

10.821067

Transactions

2

Size

14.44 KB

Version

2

Bits

0ad23176

Nonce

482,729

Timestamp

4/25/2014, 5:38:07 AM

Confirmations

6,304,754

Merkle Root

77b63d1b86a9e2581a8d19871eb8af03cb5b19a8c1fdc7abe29b51a08cfc6475
Transactions (2)
1 in → 1 out8.6800 XPM116 B
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.094 × 10¹⁰⁰(101-digit number)
10942326902955880795…02402631957674507521
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.094 × 10¹⁰⁰(101-digit number)
10942326902955880795…02402631957674507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.188 × 10¹⁰⁰(101-digit number)
21884653805911761590…04805263915349015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.376 × 10¹⁰⁰(101-digit number)
43769307611823523181…09610527830698030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.753 × 10¹⁰⁰(101-digit number)
87538615223647046363…19221055661396060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.750 × 10¹⁰¹(102-digit number)
17507723044729409272…38442111322792120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.501 × 10¹⁰¹(102-digit number)
35015446089458818545…76884222645584240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.003 × 10¹⁰¹(102-digit number)
70030892178917637090…53768445291168481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.400 × 10¹⁰²(103-digit number)
14006178435783527418…07536890582336962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.801 × 10¹⁰²(103-digit number)
28012356871567054836…15073781164673925121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.602 × 10¹⁰²(103-digit number)
56024713743134109672…30147562329347850241
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,759,817 XPM·at block #6,814,467 · 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.
Privacy Policy·

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