Block #249,200

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2013, 7:42:12 PM · Difficulty 9.9667 · 6,567,227 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8b77d7cf914a7fe8a096925598787d3f447b88dcb35b122c8ce686950b05eece

Height

#249,200

Difficulty

9.966737

Transactions

5

Size

1.83 KB

Version

2

Bits

09f77c17

Nonce

5,229

Timestamp

11/7/2013, 7:42:12 PM

Confirmations

6,567,227

Merkle Root

6c1f8c184386a53f4432661f3bdb29f4c1b475f05498ac7674533e0ae4d7e6ac
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.880 × 10⁹⁶(97-digit number)
38807225002533001134…18241391789241786241
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.880 × 10⁹⁶(97-digit number)
38807225002533001134…18241391789241786241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.761 × 10⁹⁶(97-digit number)
77614450005066002268…36482783578483572481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.552 × 10⁹⁷(98-digit number)
15522890001013200453…72965567156967144961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.104 × 10⁹⁷(98-digit number)
31045780002026400907…45931134313934289921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.209 × 10⁹⁷(98-digit number)
62091560004052801814…91862268627868579841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.241 × 10⁹⁸(99-digit number)
12418312000810560362…83724537255737159681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.483 × 10⁹⁸(99-digit number)
24836624001621120725…67449074511474319361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.967 × 10⁹⁸(99-digit number)
49673248003242241451…34898149022948638721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.934 × 10⁹⁸(99-digit number)
99346496006484482903…69796298045897277441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.986 × 10⁹⁹(100-digit number)
19869299201296896580…39592596091794554881
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,775,542 XPM·at block #6,816,426 · 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