Block #241,870

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/3/2013, 11:07:53 AM · Difficulty 9.9586 · 6,566,060 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
21601c52d990013564ab9f93590a1dacc143e8add3bb3f4f73b0e2b68ee02938

Height

#241,870

Difficulty

9.958613

Transactions

5

Size

1.07 KB

Version

2

Bits

09f567ae

Nonce

19,521

Timestamp

11/3/2013, 11:07:53 AM

Confirmations

6,566,060

Merkle Root

250a87bd800a22a8ab66b5cad41dde537dff30056f97914439a77ca545966476
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.

2.448 × 10⁹⁷(98-digit number)
24482850851139154870…28890960891875481601
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
2.448 × 10⁹⁷(98-digit number)
24482850851139154870…28890960891875481601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.896 × 10⁹⁷(98-digit number)
48965701702278309740…57781921783750963201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.793 × 10⁹⁷(98-digit number)
97931403404556619480…15563843567501926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.958 × 10⁹⁸(99-digit number)
19586280680911323896…31127687135003852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.917 × 10⁹⁸(99-digit number)
39172561361822647792…62255374270007705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.834 × 10⁹⁸(99-digit number)
78345122723645295584…24510748540015411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.566 × 10⁹⁹(100-digit number)
15669024544729059116…49021497080030822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.133 × 10⁹⁹(100-digit number)
31338049089458118233…98042994160061644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.267 × 10⁹⁹(100-digit number)
62676098178916236467…96085988320123289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.253 × 10¹⁰⁰(101-digit number)
12535219635783247293…92171976640246579201
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,707,477 XPM·at block #6,807,929 · 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