Block #261,185

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/15/2013, 9:17:03 AM · Difficulty 9.9736 · 6,572,554 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d10f4a46ca0df6d9be13582ff7b3d01e3d7f5230b3932998fe38745196f5d582

Height

#261,185

Difficulty

9.973589

Transactions

4

Size

2.48 KB

Version

2

Bits

09f93d1a

Nonce

17,840

Timestamp

11/15/2013, 9:17:03 AM

Confirmations

6,572,554

Merkle Root

6c0f8c58464cbddddca21784f639a794eec10a349a039cab3152e670dd34a68a
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.

5.312 × 10⁹⁵(96-digit number)
53124417627570132880…70503321320541866881
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
5.312 × 10⁹⁵(96-digit number)
53124417627570132880…70503321320541866881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.062 × 10⁹⁶(97-digit number)
10624883525514026576…41006642641083733761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.124 × 10⁹⁶(97-digit number)
21249767051028053152…82013285282167467521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.249 × 10⁹⁶(97-digit number)
42499534102056106304…64026570564334935041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.499 × 10⁹⁶(97-digit number)
84999068204112212608…28053141128669870081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.699 × 10⁹⁷(98-digit number)
16999813640822442521…56106282257339740161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.399 × 10⁹⁷(98-digit number)
33999627281644885043…12212564514679480321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.799 × 10⁹⁷(98-digit number)
67999254563289770087…24425129029358960641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.359 × 10⁹⁸(99-digit number)
13599850912657954017…48850258058717921281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.719 × 10⁹⁸(99-digit number)
27199701825315908034…97700516117435842561
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,914,129 XPM·at block #6,833,738 · 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