Block #387,100

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/2/2014, 9:31:12 PM · Difficulty 10.4153 · 6,422,093 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a518a7f6b671c447bca0777ab342ae07954931186e23e8de3b7d40d811be84f

Height

#387,100

Difficulty

10.415309

Transactions

2

Size

433 B

Version

2

Bits

0a6a51b2

Nonce

16,253

Timestamp

2/2/2014, 9:31:12 PM

Confirmations

6,422,093

Merkle Root

1be0c972fabf77803e267ad75888aae39fada8267079d4c9054e2fbdd74bbd11
Transactions (2)
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.

4.238 × 10⁹⁵(96-digit number)
42382103600115440335…75496738601861841999
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
4.238 × 10⁹⁵(96-digit number)
42382103600115440335…75496738601861841999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.476 × 10⁹⁵(96-digit number)
84764207200230880670…50993477203723683999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.695 × 10⁹⁶(97-digit number)
16952841440046176134…01986954407447367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.390 × 10⁹⁶(97-digit number)
33905682880092352268…03973908814894735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.781 × 10⁹⁶(97-digit number)
67811365760184704536…07947817629789471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.356 × 10⁹⁷(98-digit number)
13562273152036940907…15895635259578943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.712 × 10⁹⁷(98-digit number)
27124546304073881814…31791270519157887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.424 × 10⁹⁷(98-digit number)
54249092608147763628…63582541038315775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.084 × 10⁹⁸(99-digit number)
10849818521629552725…27165082076631551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.169 × 10⁹⁸(99-digit number)
21699637043259105451…54330164153263103999
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,717,601 XPM·at block #6,809,192 · 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