Block #382,459

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/30/2014, 5:36:25 PM · Difficulty 10.4033 · 6,434,547 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c9c258c3b3158d312d8d0b1b9dc0d8403526296be1d2fce5be5d6d00891bbb9f

Height

#382,459

Difficulty

10.403258

Transactions

6

Size

1.89 KB

Version

2

Bits

0a673bf0

Nonce

59,484

Timestamp

1/30/2014, 5:36:25 PM

Confirmations

6,434,547

Merkle Root

8894357672559771e8bed9b2f23ec609c037ead045e809c36470821702e4d7fb
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.

3.638 × 10⁹⁷(98-digit number)
36382062169356752696…71379479619518191199
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
3.638 × 10⁹⁷(98-digit number)
36382062169356752696…71379479619518191199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.276 × 10⁹⁷(98-digit number)
72764124338713505392…42758959239036382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.455 × 10⁹⁸(99-digit number)
14552824867742701078…85517918478072764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.910 × 10⁹⁸(99-digit number)
29105649735485402157…71035836956145529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.821 × 10⁹⁸(99-digit number)
58211299470970804314…42071673912291059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.164 × 10⁹⁹(100-digit number)
11642259894194160862…84143347824582118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.328 × 10⁹⁹(100-digit number)
23284519788388321725…68286695649164236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.656 × 10⁹⁹(100-digit number)
46569039576776643451…36573391298328473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.313 × 10⁹⁹(100-digit number)
93138079153553286902…73146782596656947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.862 × 10¹⁰⁰(101-digit number)
18627615830710657380…46293565193313894399
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,780,081 XPM·at block #6,817,005 · 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