Block #371,251

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/22/2014, 5:49:19 PM · Difficulty 10.4347 · 6,454,190 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5b21aac82e3172ed72a53af63486ac7228ad5551f54723425b073581146d95d2

Height

#371,251

Difficulty

10.434734

Transactions

7

Size

2.10 KB

Version

2

Bits

0a6f4abd

Nonce

14,513

Timestamp

1/22/2014, 5:49:19 PM

Confirmations

6,454,190

Merkle Root

2ebca84a89e7ebfe3697d0dfa3d2c2a8da2ba90c3d8a8815e32f747f6d75d064
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.

8.539 × 10¹⁰⁴(105-digit number)
85390873753254037550…11273960351668552549
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
8.539 × 10¹⁰⁴(105-digit number)
85390873753254037550…11273960351668552549
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.707 × 10¹⁰⁵(106-digit number)
17078174750650807510…22547920703337105099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.415 × 10¹⁰⁵(106-digit number)
34156349501301615020…45095841406674210199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.831 × 10¹⁰⁵(106-digit number)
68312699002603230040…90191682813348420399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.366 × 10¹⁰⁶(107-digit number)
13662539800520646008…80383365626696840799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.732 × 10¹⁰⁶(107-digit number)
27325079601041292016…60766731253393681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.465 × 10¹⁰⁶(107-digit number)
54650159202082584032…21533462506787363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.093 × 10¹⁰⁷(108-digit number)
10930031840416516806…43066925013574726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.186 × 10¹⁰⁷(108-digit number)
21860063680833033612…86133850027149452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.372 × 10¹⁰⁷(108-digit number)
43720127361666067225…72267700054298905599
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,847,632 XPM·at block #6,825,440 · 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