Block #2,239,703

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/6/2017, 4:15:48 PM · Difficulty 10.9462 · 4,593,510 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
96509d4581755cd7eee76855f380adfdbe2ecd65157008ded22dbb4a33f34886

Height

#2,239,703

Difficulty

10.946162

Transactions

2

Size

576 B

Version

2

Bits

0af237b0

Nonce

844,372,616

Timestamp

8/6/2017, 4:15:48 PM

Confirmations

4,593,510

Merkle Root

986d120c80da25fb2b4ad2e74cea180dc21b08ca6570470c7a7a5fded87ccddc
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.

1.986 × 10⁹⁵(96-digit number)
19864669573417603321…73490135252492213759
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
1.986 × 10⁹⁵(96-digit number)
19864669573417603321…73490135252492213759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.972 × 10⁹⁵(96-digit number)
39729339146835206643…46980270504984427519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.945 × 10⁹⁵(96-digit number)
79458678293670413286…93960541009968855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.589 × 10⁹⁶(97-digit number)
15891735658734082657…87921082019937710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.178 × 10⁹⁶(97-digit number)
31783471317468165314…75842164039875420159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.356 × 10⁹⁶(97-digit number)
63566942634936330629…51684328079750840319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.271 × 10⁹⁷(98-digit number)
12713388526987266125…03368656159501680639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.542 × 10⁹⁷(98-digit number)
25426777053974532251…06737312319003361279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.085 × 10⁹⁷(98-digit number)
50853554107949064503…13474624638006722559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.017 × 10⁹⁸(99-digit number)
10170710821589812900…26949249276013445119
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,909,890 XPM·at block #6,833,212 · 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