Block #517,519

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2014, 12:23:05 AM · Difficulty 10.8514 · 6,322,996 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1151f34e4f77c32de44efcb00fe86f20c4aa47517d54173e205b03f0cb57fb74

Height

#517,519

Difficulty

10.851432

Transactions

15

Size

4.53 KB

Version

2

Bits

0ad9f779

Nonce

318,974,988

Timestamp

4/30/2014, 12:23:05 AM

Confirmations

6,322,996

Merkle Root

49f0e4043c9443b512186be5068fc5a5df86ab58a4c7ea332f09433350f0e887
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.

4.206 × 10⁹⁹(100-digit number)
42065418313986850127…90646422605589094399
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
4.206 × 10⁹⁹(100-digit number)
42065418313986850127…90646422605589094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.413 × 10⁹⁹(100-digit number)
84130836627973700254…81292845211178188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.682 × 10¹⁰⁰(101-digit number)
16826167325594740050…62585690422356377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.365 × 10¹⁰⁰(101-digit number)
33652334651189480101…25171380844712755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.730 × 10¹⁰⁰(101-digit number)
67304669302378960203…50342761689425510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.346 × 10¹⁰¹(102-digit number)
13460933860475792040…00685523378851020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.692 × 10¹⁰¹(102-digit number)
26921867720951584081…01371046757702041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.384 × 10¹⁰¹(102-digit number)
53843735441903168162…02742093515404083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.076 × 10¹⁰²(103-digit number)
10768747088380633632…05484187030808166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.153 × 10¹⁰²(103-digit number)
21537494176761267265…10968374061616332799
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,968,448 XPM·at block #6,840,514 · 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