Block #961,851

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/5/2015, 1:55:07 AM · Difficulty 10.8821 · 5,852,157 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
30db6c32bb07333752eb9922a4d467d4cc85034e341ab77956640cf234021eab

Height

#961,851

Difficulty

10.882085

Transactions

8

Size

2.17 KB

Version

2

Bits

0ae1d051

Nonce

68,176

Timestamp

3/5/2015, 1:55:07 AM

Confirmations

5,852,157

Merkle Root

7b3acb618a5e5d1add903966f6f72e6a2602220419556520a4109ce7004c9968
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.642 × 10⁹³(94-digit number)
46423754195693508643…61306900589513613701
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.642 × 10⁹³(94-digit number)
46423754195693508643…61306900589513613701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.284 × 10⁹³(94-digit number)
92847508391387017286…22613801179027227401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.856 × 10⁹⁴(95-digit number)
18569501678277403457…45227602358054454801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.713 × 10⁹⁴(95-digit number)
37139003356554806914…90455204716108909601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.427 × 10⁹⁴(95-digit number)
74278006713109613829…80910409432217819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.485 × 10⁹⁵(96-digit number)
14855601342621922765…61820818864435638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.971 × 10⁹⁵(96-digit number)
29711202685243845531…23641637728871276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.942 × 10⁹⁵(96-digit number)
59422405370487691063…47283275457742553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.188 × 10⁹⁶(97-digit number)
11884481074097538212…94566550915485107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.376 × 10⁹⁶(97-digit number)
23768962148195076425…89133101830970214401
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,756,146 XPM·at block #6,814,007 · 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