Block #942,345

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/18/2015, 9:28:04 PM · Difficulty 10.9012 · 5,899,898 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8deaef8562792099a556ffc67b8c9e215933f400b368da90ca1b10a654f2beb5

Height

#942,345

Difficulty

10.901162

Transactions

14

Size

4.74 KB

Version

2

Bits

0ae6b28b

Nonce

331,124,239

Timestamp

2/18/2015, 9:28:04 PM

Confirmations

5,899,898

Merkle Root

37fccb17740b12f2fb7d069e3005057fce94da0d6d5a2fd36c028989ebebdc92
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.439 × 10⁹⁵(96-digit number)
24392633904873378193…43883081802949395599
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.439 × 10⁹⁵(96-digit number)
24392633904873378193…43883081802949395599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.878 × 10⁹⁵(96-digit number)
48785267809746756386…87766163605898791199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.757 × 10⁹⁵(96-digit number)
97570535619493512772…75532327211797582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.951 × 10⁹⁶(97-digit number)
19514107123898702554…51064654423595164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.902 × 10⁹⁶(97-digit number)
39028214247797405108…02129308847190329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.805 × 10⁹⁶(97-digit number)
78056428495594810217…04258617694380659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.561 × 10⁹⁷(98-digit number)
15611285699118962043…08517235388761318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.122 × 10⁹⁷(98-digit number)
31222571398237924087…17034470777522636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.244 × 10⁹⁷(98-digit number)
62445142796475848174…34068941555045273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.248 × 10⁹⁸(99-digit number)
12489028559295169634…68137883110090547199
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,982,342 XPM·at block #6,842,242 · 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