Block #374,534

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 2:38:20 AM · Difficulty 10.4214 · 6,442,875 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c8f6841f8c8b9984ab58cb9c14c1ace335b2f7e5fd085ba9f64dd2305e4a33e0

Height

#374,534

Difficulty

10.421353

Transactions

9

Size

3.62 KB

Version

2

Bits

0a6bddc9

Nonce

136,679

Timestamp

1/25/2014, 2:38:20 AM

Confirmations

6,442,875

Merkle Root

c0d1b505e687586969d78f396071039a5c01353a6e56cef756a6942a2956e116
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.

2.369 × 10⁹⁵(96-digit number)
23692684188170104138…68987867664995211279
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
2.369 × 10⁹⁵(96-digit number)
23692684188170104138…68987867664995211279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.738 × 10⁹⁵(96-digit number)
47385368376340208277…37975735329990422559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.477 × 10⁹⁵(96-digit number)
94770736752680416555…75951470659980845119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.895 × 10⁹⁶(97-digit number)
18954147350536083311…51902941319961690239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.790 × 10⁹⁶(97-digit number)
37908294701072166622…03805882639923380479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.581 × 10⁹⁶(97-digit number)
75816589402144333244…07611765279846760959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.516 × 10⁹⁷(98-digit number)
15163317880428866648…15223530559693521919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.032 × 10⁹⁷(98-digit number)
30326635760857733297…30447061119387043839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.065 × 10⁹⁷(98-digit number)
60653271521715466595…60894122238774087679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.213 × 10⁹⁸(99-digit number)
12130654304343093319…21788244477548175359
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,783,316 XPM·at block #6,817,408 · 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