Block #950,909

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/24/2015, 10:58:08 PM · Difficulty 10.8981 · 5,865,313 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ba1642598b1dedc8f15bea62fd53b2c1c3e146b1c70b7b926a6c95280f77b5d1

Height

#950,909

Difficulty

10.898115

Transactions

10

Size

2.05 KB

Version

2

Bits

0ae5eadb

Nonce

86,127,259

Timestamp

2/24/2015, 10:58:08 PM

Confirmations

5,865,313

Merkle Root

5f6a00e5418dd87a488e41fb7469e0be23188078c57c2b5cea58fffa2782f439
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.

8.853 × 10⁹⁶(97-digit number)
88536550115650986243…08503739853338915201
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
8.853 × 10⁹⁶(97-digit number)
88536550115650986243…08503739853338915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.770 × 10⁹⁷(98-digit number)
17707310023130197248…17007479706677830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.541 × 10⁹⁷(98-digit number)
35414620046260394497…34014959413355660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.082 × 10⁹⁷(98-digit number)
70829240092520788995…68029918826711321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.416 × 10⁹⁸(99-digit number)
14165848018504157799…36059837653422643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.833 × 10⁹⁸(99-digit number)
28331696037008315598…72119675306845286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.666 × 10⁹⁸(99-digit number)
56663392074016631196…44239350613690572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.133 × 10⁹⁹(100-digit number)
11332678414803326239…88478701227381145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.266 × 10⁹⁹(100-digit number)
22665356829606652478…76957402454762291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.533 × 10⁹⁹(100-digit number)
45330713659213304956…53914804909524582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.066 × 10⁹⁹(100-digit number)
90661427318426609913…07829609819049164801
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,773,904 XPM·at block #6,816,221 · 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