Block #248,133

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2013, 5:04:36 AM · Difficulty 9.9654 · 6,576,503 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5cd1b3ada4b98eb010be6100cb123efbdcad2609451b5ff008e2fbb060363365

Height

#248,133

Difficulty

9.965421

Transactions

5

Size

21.28 KB

Version

2

Bits

09f725ce

Nonce

13,165

Timestamp

11/7/2013, 5:04:36 AM

Confirmations

6,576,503

Merkle Root

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

6.647 × 10⁹⁵(96-digit number)
66476235897364881692…80794025897243623421
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
6.647 × 10⁹⁵(96-digit number)
66476235897364881692…80794025897243623421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.329 × 10⁹⁶(97-digit number)
13295247179472976338…61588051794487246841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.659 × 10⁹⁶(97-digit number)
26590494358945952676…23176103588974493681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.318 × 10⁹⁶(97-digit number)
53180988717891905353…46352207177948987361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.063 × 10⁹⁷(98-digit number)
10636197743578381070…92704414355897974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.127 × 10⁹⁷(98-digit number)
21272395487156762141…85408828711795949441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.254 × 10⁹⁷(98-digit number)
42544790974313524283…70817657423591898881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.508 × 10⁹⁷(98-digit number)
85089581948627048566…41635314847183797761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.701 × 10⁹⁸(99-digit number)
17017916389725409713…83270629694367595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.403 × 10⁹⁸(99-digit number)
34035832779450819426…66541259388735191041
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,841,152 XPM·at block #6,824,635 · 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