Block #509,559

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2014, 3:28:20 AM · Difficulty 10.8202 · 6,298,278 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e4454c3fa531482bf105a945f0e6de65048212f648e3c45d8af0a68c0ca41655

Height

#509,559

Difficulty

10.820184

Transactions

5

Size

2.31 KB

Version

2

Bits

0ad1f790

Nonce

134,005,388

Timestamp

4/25/2014, 3:28:20 AM

Confirmations

6,298,278

Merkle Root

9725b97c15b2f838c97c9d9e327d327f583a429f2e4aa0d5804b3465280b764c
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.263 × 10⁹⁸(99-digit number)
42631327961933069776…75850184204069112799
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.263 × 10⁹⁸(99-digit number)
42631327961933069776…75850184204069112799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.526 × 10⁹⁸(99-digit number)
85262655923866139553…51700368408138225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.705 × 10⁹⁹(100-digit number)
17052531184773227910…03400736816276451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.410 × 10⁹⁹(100-digit number)
34105062369546455821…06801473632552902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.821 × 10⁹⁹(100-digit number)
68210124739092911643…13602947265105804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.364 × 10¹⁰⁰(101-digit number)
13642024947818582328…27205894530211609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.728 × 10¹⁰⁰(101-digit number)
27284049895637164657…54411789060423219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.456 × 10¹⁰⁰(101-digit number)
54568099791274329314…08823578120846438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.091 × 10¹⁰¹(102-digit number)
10913619958254865862…17647156241692876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.182 × 10¹⁰¹(102-digit number)
21827239916509731725…35294312483385753599
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,706,733 XPM·at block #6,807,836 · 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