Block #243,716

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/4/2013, 11:08:37 AM · Difficulty 9.9619 · 6,582,398 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1accb0e4caeca67392a2b3c0685214973f4d2a5b42e98350b84825e509119bb5

Height

#243,716

Difficulty

9.961888

Transactions

1

Size

1.77 KB

Version

2

Bits

09f63e44

Nonce

70,192

Timestamp

11/4/2013, 11:08:37 AM

Confirmations

6,582,398

Merkle Root

83d5fe9ea59c8a9ccf5739d2f912c0620916db8b1dfb6467ec1035a629bca108
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.880 × 10⁹⁰(91-digit number)
28801212766918074077…19258468579416121021
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.880 × 10⁹⁰(91-digit number)
28801212766918074077…19258468579416121021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.760 × 10⁹⁰(91-digit number)
57602425533836148155…38516937158832242041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.152 × 10⁹¹(92-digit number)
11520485106767229631…77033874317664484081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.304 × 10⁹¹(92-digit number)
23040970213534459262…54067748635328968161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.608 × 10⁹¹(92-digit number)
46081940427068918524…08135497270657936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.216 × 10⁹¹(92-digit number)
92163880854137837049…16270994541315872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.843 × 10⁹²(93-digit number)
18432776170827567409…32541989082631745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.686 × 10⁹²(93-digit number)
36865552341655134819…65083978165263490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.373 × 10⁹²(93-digit number)
73731104683310269639…30167956330526981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.474 × 10⁹³(94-digit number)
14746220936662053927…60335912661053962241
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,853,037 XPM·at block #6,826,113 · 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