Block #506,169

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/22/2014, 10:12:37 PM · Difficulty 10.8130 · 6,301,151 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd679ce960881771470eeb0ca68b3b56a1143b686ce96cc671b7d72083098099

Height

#506,169

Difficulty

10.812985

Transactions

4

Size

850 B

Version

2

Bits

0ad01fc2

Nonce

479,902,360

Timestamp

4/22/2014, 10:12:37 PM

Confirmations

6,301,151

Merkle Root

0a8b50be29c6ffe9a6954256b75d0d02ae61e794ff1bb6b91c2bd6f502dac8e4
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.

5.411 × 10⁹⁷(98-digit number)
54116996176173249359…23024402022147145019
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
5.411 × 10⁹⁷(98-digit number)
54116996176173249359…23024402022147145019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.082 × 10⁹⁸(99-digit number)
10823399235234649871…46048804044294290039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.164 × 10⁹⁸(99-digit number)
21646798470469299743…92097608088588580079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.329 × 10⁹⁸(99-digit number)
43293596940938599487…84195216177177160159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.658 × 10⁹⁸(99-digit number)
86587193881877198974…68390432354354320319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.731 × 10⁹⁹(100-digit number)
17317438776375439794…36780864708708640639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.463 × 10⁹⁹(100-digit number)
34634877552750879589…73561729417417281279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.926 × 10⁹⁹(100-digit number)
69269755105501759179…47123458834834562559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.385 × 10¹⁰⁰(101-digit number)
13853951021100351835…94246917669669125119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.770 × 10¹⁰⁰(101-digit number)
27707902042200703671…88493835339338250239
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,702,576 XPM·at block #6,807,319 · 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