Block #638,148

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/18/2014, 7:48:10 AM · Difficulty 10.9617 · 6,179,209 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8b0959e9d976c0e563a5e6914d4f62c31c2b144aabe97ffc5a29aa30975ec744

Height

#638,148

Difficulty

10.961668

Transactions

6

Size

1.30 KB

Version

2

Bits

0af62fe7

Nonce

109,963

Timestamp

7/18/2014, 7:48:10 AM

Confirmations

6,179,209

Merkle Root

cbc6da0685acaf87eb7fd4f46bb899a0d2e8587d87119783663301ff5625754a
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.722 × 10⁹⁶(97-digit number)
17222400228479512234…81835352980298944899
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.722 × 10⁹⁶(97-digit number)
17222400228479512234…81835352980298944899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.444 × 10⁹⁶(97-digit number)
34444800456959024468…63670705960597889799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.888 × 10⁹⁶(97-digit number)
68889600913918048937…27341411921195779599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.377 × 10⁹⁷(98-digit number)
13777920182783609787…54682823842391559199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.755 × 10⁹⁷(98-digit number)
27555840365567219575…09365647684783118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.511 × 10⁹⁷(98-digit number)
55111680731134439150…18731295369566236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.102 × 10⁹⁸(99-digit number)
11022336146226887830…37462590739132473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.204 × 10⁹⁸(99-digit number)
22044672292453775660…74925181478264947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.408 × 10⁹⁸(99-digit number)
44089344584907551320…49850362956529894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.817 × 10⁹⁸(99-digit number)
88178689169815102640…99700725913059788799
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,782,904 XPM·at block #6,817,356 · 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.
Privacy Policy·

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