Block #243,505

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/4/2013, 8:18:49 AM · Difficulty 9.9616 · 6,587,039 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
471365648a4ee7f639107c43af9877524013801e641d647950e3b9ad45cf6f7e

Height

#243,505

Difficulty

9.961575

Transactions

2

Size

896 B

Version

2

Bits

09f629c1

Nonce

19,346

Timestamp

11/4/2013, 8:18:49 AM

Confirmations

6,587,039

Merkle Root

a7714374f95f0fe3da7438afea616a3cb9df2cdbdd0e1e7e0e7497a0fbda9643
Transactions (2)
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.958 × 10⁹⁷(98-digit number)
19588851502286356497…70059545243908795801
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.958 × 10⁹⁷(98-digit number)
19588851502286356497…70059545243908795801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.917 × 10⁹⁷(98-digit number)
39177703004572712995…40119090487817591601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.835 × 10⁹⁷(98-digit number)
78355406009145425990…80238180975635183201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.567 × 10⁹⁸(99-digit number)
15671081201829085198…60476361951270366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.134 × 10⁹⁸(99-digit number)
31342162403658170396…20952723902540732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.268 × 10⁹⁸(99-digit number)
62684324807316340792…41905447805081465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.253 × 10⁹⁹(100-digit number)
12536864961463268158…83810895610162931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.507 × 10⁹⁹(100-digit number)
25073729922926536316…67621791220325862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.014 × 10⁹⁹(100-digit number)
50147459845853072633…35243582440651724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.002 × 10¹⁰⁰(101-digit number)
10029491969170614526…70487164881303449601
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,888,600 XPM·at block #6,830,543 · 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