Block #258,682

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/13/2013, 5:02:50 AM · Difficulty 9.9766 · 6,551,058 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
042be781a78b51439ec2946ec928460113fb8defa2580483b222690f3ded4419

Height

#258,682

Difficulty

9.976607

Transactions

9

Size

22.85 KB

Version

2

Bits

09fa02e9

Nonce

4,493

Timestamp

11/13/2013, 5:02:50 AM

Confirmations

6,551,058

Merkle Root

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

1.294 × 10⁹⁵(96-digit number)
12948713774998212827…82627379755179505281
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
1.294 × 10⁹⁵(96-digit number)
12948713774998212827…82627379755179505281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.589 × 10⁹⁵(96-digit number)
25897427549996425655…65254759510359010561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.179 × 10⁹⁵(96-digit number)
51794855099992851310…30509519020718021121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.035 × 10⁹⁶(97-digit number)
10358971019998570262…61019038041436042241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.071 × 10⁹⁶(97-digit number)
20717942039997140524…22038076082872084481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.143 × 10⁹⁶(97-digit number)
41435884079994281048…44076152165744168961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.287 × 10⁹⁶(97-digit number)
82871768159988562097…88152304331488337921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.657 × 10⁹⁷(98-digit number)
16574353631997712419…76304608662976675841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.314 × 10⁹⁷(98-digit number)
33148707263995424838…52609217325953351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.629 × 10⁹⁷(98-digit number)
66297414527990849677…05218434651906703361
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,722,003 XPM·at block #6,809,739 · 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