Block #952,059

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/25/2015, 8:31:17 PM · Difficulty 10.8953 · 5,873,520 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f96c5ad28eb5d2fa204cea8e06bab4f90099e2c93fc3b8028cb62194c5df5eb6

Height

#952,059

Difficulty

10.895251

Transactions

15

Size

5.15 KB

Version

2

Bits

0ae52f2b

Nonce

9,771,560

Timestamp

2/25/2015, 8:31:17 PM

Confirmations

5,873,520

Merkle Root

c1f1cde1b792a1adbdce2f7dacabe3cafa91ca2ac1f072fe4098300e38e3d7cf
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.

3.271 × 10⁹⁶(97-digit number)
32715301324296126401…10835378713822155161
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
3.271 × 10⁹⁶(97-digit number)
32715301324296126401…10835378713822155161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.543 × 10⁹⁶(97-digit number)
65430602648592252802…21670757427644310321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.308 × 10⁹⁷(98-digit number)
13086120529718450560…43341514855288620641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.617 × 10⁹⁷(98-digit number)
26172241059436901120…86683029710577241281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.234 × 10⁹⁷(98-digit number)
52344482118873802241…73366059421154482561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.046 × 10⁹⁸(99-digit number)
10468896423774760448…46732118842308965121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.093 × 10⁹⁸(99-digit number)
20937792847549520896…93464237684617930241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.187 × 10⁹⁸(99-digit number)
41875585695099041793…86928475369235860481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.375 × 10⁹⁸(99-digit number)
83751171390198083586…73856950738471720961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.675 × 10⁹⁹(100-digit number)
16750234278039616717…47713901476943441921
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,848,733 XPM·at block #6,825,578 · 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