Block #275,862

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 10:06:08 PM · Difficulty 9.9617 · 6,540,299 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
af2408deaa2a1c641cf50be2d1e1c45a84f9b670044b1b05b3da51b139fc13ea

Height

#275,862

Difficulty

9.961749

Transactions

1

Size

1.11 KB

Version

2

Bits

09f63532

Nonce

281,560

Timestamp

11/26/2013, 10:06:08 PM

Confirmations

6,540,299

Merkle Root

58fc4376ca6c7ec95fdaccb6e97a324dd10a7d4203fccc203aa2197eca682936
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.

5.094 × 10⁹⁷(98-digit number)
50949072322325969788…35289873074850676321
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
5.094 × 10⁹⁷(98-digit number)
50949072322325969788…35289873074850676321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.018 × 10⁹⁸(99-digit number)
10189814464465193957…70579746149701352641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.037 × 10⁹⁸(99-digit number)
20379628928930387915…41159492299402705281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.075 × 10⁹⁸(99-digit number)
40759257857860775830…82318984598805410561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.151 × 10⁹⁸(99-digit number)
81518515715721551660…64637969197610821121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.630 × 10⁹⁹(100-digit number)
16303703143144310332…29275938395221642241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.260 × 10⁹⁹(100-digit number)
32607406286288620664…58551876790443284481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.521 × 10⁹⁹(100-digit number)
65214812572577241328…17103753580886568961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.304 × 10¹⁰⁰(101-digit number)
13042962514515448265…34207507161773137921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.608 × 10¹⁰⁰(101-digit number)
26085925029030896531…68415014323546275841
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,773,411 XPM·at block #6,816,160 · 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