Block #508,512

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/24/2014, 10:48:21 AM · Difficulty 10.8185 · 6,318,799 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db9b5f8eff7f51563db82e578b44c39571c8eaefc60b85d027bf3fc53fc20a9f

Height

#508,512

Difficulty

10.818487

Transactions

7

Size

2.11 KB

Version

2

Bits

0ad18859

Nonce

14,106

Timestamp

4/24/2014, 10:48:21 AM

Confirmations

6,318,799

Merkle Root

31714284c1fa42b16ae0fbce15d0dcd6e70465a3309cfc53a9437d12152afef8
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.507 × 10⁹⁸(99-digit number)
75074682135257102327…51842510202549784639
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.507 × 10⁹⁸(99-digit number)
75074682135257102327…51842510202549784639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.501 × 10⁹⁹(100-digit number)
15014936427051420465…03685020405099569279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.002 × 10⁹⁹(100-digit number)
30029872854102840930…07370040810199138559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.005 × 10⁹⁹(100-digit number)
60059745708205681861…14740081620398277119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.201 × 10¹⁰⁰(101-digit number)
12011949141641136372…29480163240796554239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.402 × 10¹⁰⁰(101-digit number)
24023898283282272744…58960326481593108479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.804 × 10¹⁰⁰(101-digit number)
48047796566564545489…17920652963186216959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.609 × 10¹⁰⁰(101-digit number)
96095593133129090978…35841305926372433919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.921 × 10¹⁰¹(102-digit number)
19219118626625818195…71682611852744867839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.843 × 10¹⁰¹(102-digit number)
38438237253251636391…43365223705489735679
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,862,600 XPM·at block #6,827,310 · 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