Block #517,499

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2014, 12:05:03 AM · Difficulty 10.8513 · 6,292,035 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
067f8428e97c1276135b2df5a86307c587569c28e213c61f2f8ad06dfa98dc66

Height

#517,499

Difficulty

10.851289

Transactions

3

Size

807 B

Version

2

Bits

0ad9ee17

Nonce

56,012,567

Timestamp

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

Confirmations

6,292,035

Merkle Root

012e29c3dc311a961a6c9fec36f832c950ba533ad9e7da494c8d9bbb01dffa68
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.

2.940 × 10⁹⁹(100-digit number)
29407554130190272475…78158990885271167999
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
2.940 × 10⁹⁹(100-digit number)
29407554130190272475…78158990885271167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.881 × 10⁹⁹(100-digit number)
58815108260380544950…56317981770542335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.176 × 10¹⁰⁰(101-digit number)
11763021652076108990…12635963541084671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.352 × 10¹⁰⁰(101-digit number)
23526043304152217980…25271927082169343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.705 × 10¹⁰⁰(101-digit number)
47052086608304435960…50543854164338687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.410 × 10¹⁰⁰(101-digit number)
94104173216608871920…01087708328677375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.882 × 10¹⁰¹(102-digit number)
18820834643321774384…02175416657354751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.764 × 10¹⁰¹(102-digit number)
37641669286643548768…04350833314709503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.528 × 10¹⁰¹(102-digit number)
75283338573287097536…08701666629419007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.505 × 10¹⁰²(103-digit number)
15056667714657419507…17403333258838015999
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,720,351 XPM·at block #6,809,533 · 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