Block #939,159

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2015, 4:46:03 PM · Difficulty 10.9004 · 5,871,270 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a57d40be4f91e258a4c2a0bf11df2adf4042c7d29f9b9ca82f16226002d2d1ce

Height

#939,159

Difficulty

10.900446

Transactions

6

Size

3.04 KB

Version

2

Bits

0ae683a6

Nonce

538,072,289

Timestamp

2/16/2015, 4:46:03 PM

Confirmations

5,871,270

Merkle Root

9a82725ad02dfced7bfbb0b4813d81f4ccbec164e2d53e39129d1e962a7fad7b
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.361 × 10⁹⁵(96-digit number)
23617871044958310538…47814149788189002321
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.361 × 10⁹⁵(96-digit number)
23617871044958310538…47814149788189002321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.723 × 10⁹⁵(96-digit number)
47235742089916621076…95628299576378004641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.447 × 10⁹⁵(96-digit number)
94471484179833242153…91256599152756009281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.889 × 10⁹⁶(97-digit number)
18894296835966648430…82513198305512018561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.778 × 10⁹⁶(97-digit number)
37788593671933296861…65026396611024037121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.557 × 10⁹⁶(97-digit number)
75577187343866593723…30052793222048074241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.511 × 10⁹⁷(98-digit number)
15115437468773318744…60105586444096148481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.023 × 10⁹⁷(98-digit number)
30230874937546637489…20211172888192296961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.046 × 10⁹⁷(98-digit number)
60461749875093274978…40422345776384593921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.209 × 10⁹⁸(99-digit number)
12092349975018654995…80844691552769187841
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,727,514 XPM·at block #6,810,428 · 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