Block #258,099

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/12/2013, 8:40:05 PM · Difficulty 9.9762 · 6,557,916 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f38d52a5554f5755ac2354d0034a46387c3171e65622a4d2e072284e20b261c1

Height

#258,099

Difficulty

9.976214

Transactions

5

Size

1.94 KB

Version

2

Bits

09f9e92c

Nonce

34,047

Timestamp

11/12/2013, 8:40:05 PM

Confirmations

6,557,916

Merkle Root

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

9.447 × 10⁹⁵(96-digit number)
94472971998524675596…55970750120202795201
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
9.447 × 10⁹⁵(96-digit number)
94472971998524675596…55970750120202795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.889 × 10⁹⁶(97-digit number)
18894594399704935119…11941500240405590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.778 × 10⁹⁶(97-digit number)
37789188799409870238…23883000480811180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.557 × 10⁹⁶(97-digit number)
75578377598819740477…47766000961622361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.511 × 10⁹⁷(98-digit number)
15115675519763948095…95532001923244723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.023 × 10⁹⁷(98-digit number)
30231351039527896190…91064003846489446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.046 × 10⁹⁷(98-digit number)
60462702079055792381…82128007692978892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.209 × 10⁹⁸(99-digit number)
12092540415811158476…64256015385957785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.418 × 10⁹⁸(99-digit number)
24185080831622316952…28512030771915571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.837 × 10⁹⁸(99-digit number)
48370161663244633905…57024061543831142401
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,772,238 XPM·at block #6,816,014 · 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