Block #550,059

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/17/2014, 11:03:23 PM · Difficulty 10.9613 · 6,261,001 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b750f76d89f62362d430b7809d9a9105940215dfa0eb07ac0e58883047a1a8f3

Height

#550,059

Difficulty

10.961272

Transactions

11

Size

9.35 KB

Version

2

Bits

0af615ea

Nonce

332,404,888

Timestamp

5/17/2014, 11:03:23 PM

Confirmations

6,261,001

Merkle Root

ac1518f5abc703693450712d0c5927d0b1d5a65b3dda0711d6f0a5f747a581bf
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.146 × 10⁹⁸(99-digit number)
11462681805887265690…81230165631903857039
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.146 × 10⁹⁸(99-digit number)
11462681805887265690…81230165631903857039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.292 × 10⁹⁸(99-digit number)
22925363611774531380…62460331263807714079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.585 × 10⁹⁸(99-digit number)
45850727223549062760…24920662527615428159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.170 × 10⁹⁸(99-digit number)
91701454447098125521…49841325055230856319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.834 × 10⁹⁹(100-digit number)
18340290889419625104…99682650110461712639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.668 × 10⁹⁹(100-digit number)
36680581778839250208…99365300220923425279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.336 × 10⁹⁹(100-digit number)
73361163557678500416…98730600441846850559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.467 × 10¹⁰⁰(101-digit number)
14672232711535700083…97461200883693701119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.934 × 10¹⁰⁰(101-digit number)
29344465423071400166…94922401767387402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.868 × 10¹⁰⁰(101-digit number)
58688930846142800333…89844803534774804479
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,732,585 XPM·at block #6,811,059 · 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