Block #506,960

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2014, 10:11:16 AM · Difficulty 10.8156 · 6,303,523 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd3fdc1e1dddc6732fdbd74144d1ae0356202184a3f9424f569e565746993337

Height

#506,960

Difficulty

10.815649

Transactions

7

Size

2.25 KB

Version

2

Bits

0ad0ce5e

Nonce

152,217,226

Timestamp

4/23/2014, 10:11:16 AM

Confirmations

6,303,523

Merkle Root

d64e34c5568c57b4710e8a1a55cf37c42886137d57a4d7443ecf657ba897f541
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.503 × 10⁹⁸(99-digit number)
15039674097318350959…19963388643764811849
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.503 × 10⁹⁸(99-digit number)
15039674097318350959…19963388643764811849
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.007 × 10⁹⁸(99-digit number)
30079348194636701919…39926777287529623699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.015 × 10⁹⁸(99-digit number)
60158696389273403839…79853554575059247399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.203 × 10⁹⁹(100-digit number)
12031739277854680767…59707109150118494799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.406 × 10⁹⁹(100-digit number)
24063478555709361535…19414218300236989599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.812 × 10⁹⁹(100-digit number)
48126957111418723071…38828436600473979199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.625 × 10⁹⁹(100-digit number)
96253914222837446143…77656873200947958399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.925 × 10¹⁰⁰(101-digit number)
19250782844567489228…55313746401895916799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.850 × 10¹⁰⁰(101-digit number)
38501565689134978457…10627492803791833599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.700 × 10¹⁰⁰(101-digit number)
77003131378269956914…21254985607583667199
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,727,944 XPM·at block #6,810,482 · 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