Block #509,611

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2014, 4:19:13 AM · Difficulty 10.8202 · 6,299,067 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3be3aafe9f395e9e9221bdc54939302e9b51275517f7648b74b7a50fbac01197

Height

#509,611

Difficulty

10.820208

Transactions

2

Size

4.62 KB

Version

2

Bits

0ad1f92d

Nonce

11,294

Timestamp

4/25/2014, 4:19:13 AM

Confirmations

6,299,067

Merkle Root

78afc5b197a857a59d1d5e4957eef7775c6c104fffdcffb109bc0f99b71b9946
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.

1.954 × 10⁹⁹(100-digit number)
19546323076987810960…22091563051673057279
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
1.954 × 10⁹⁹(100-digit number)
19546323076987810960…22091563051673057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.909 × 10⁹⁹(100-digit number)
39092646153975621920…44183126103346114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.818 × 10⁹⁹(100-digit number)
78185292307951243840…88366252206692229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.563 × 10¹⁰⁰(101-digit number)
15637058461590248768…76732504413384458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.127 × 10¹⁰⁰(101-digit number)
31274116923180497536…53465008826768916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.254 × 10¹⁰⁰(101-digit number)
62548233846360995072…06930017653537832959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.250 × 10¹⁰¹(102-digit number)
12509646769272199014…13860035307075665919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.501 × 10¹⁰¹(102-digit number)
25019293538544398029…27720070614151331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.003 × 10¹⁰¹(102-digit number)
50038587077088796058…55440141228302663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.000 × 10¹⁰²(103-digit number)
10007717415417759211…10880282456605327359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.001 × 10¹⁰²(103-digit number)
20015434830835518423…21760564913210654719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,713,470 XPM·at block #6,808,677 · 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