Block #510,209

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2014, 12:48:21 PM · Difficulty 10.8213 · 6,304,654 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
36814dfe19f007e8850bdfe7ac18b37e3a3f2c2ef2259c7f6c2dc903028306f3

Height

#510,209

Difficulty

10.821259

Transactions

11

Size

3.10 KB

Version

2

Bits

0ad23e03

Nonce

190,932,531

Timestamp

4/25/2014, 12:48:21 PM

Confirmations

6,304,654

Merkle Root

c0412be57f4845593da7335dc3c9a1d5c22b566a4719a4d546cd673f0ff4b1e7
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.480 × 10⁹⁷(98-digit number)
24806119861285308401…74403489794882741639
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.480 × 10⁹⁷(98-digit number)
24806119861285308401…74403489794882741639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.961 × 10⁹⁷(98-digit number)
49612239722570616803…48806979589765483279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.922 × 10⁹⁷(98-digit number)
99224479445141233607…97613959179530966559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.984 × 10⁹⁸(99-digit number)
19844895889028246721…95227918359061933119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.968 × 10⁹⁸(99-digit number)
39689791778056493443…90455836718123866239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.937 × 10⁹⁸(99-digit number)
79379583556112986886…80911673436247732479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.587 × 10⁹⁹(100-digit number)
15875916711222597377…61823346872495464959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.175 × 10⁹⁹(100-digit number)
31751833422445194754…23646693744990929919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.350 × 10⁹⁹(100-digit number)
63503666844890389508…47293387489981859839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.270 × 10¹⁰⁰(101-digit number)
12700733368978077901…94586774979963719679
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,762,988 XPM·at block #6,814,862 · 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