Block #286,684

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 12:00:20 AM · Difficulty 9.9859 · 6,520,172 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3f176f0b58ee10bab6c26b00e0a44569181b55b45d87ac222f0e7d316488451

Height

#286,684

Difficulty

9.985891

Transactions

7

Size

2.10 KB

Version

2

Bits

09fc635b

Nonce

177,436

Timestamp

12/1/2013, 12:00:20 AM

Confirmations

6,520,172

Merkle Root

993f916931fa005c96c040e0f48988ea370f1bb8bd266add093f8904bace1a21
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.

4.890 × 10⁹³(94-digit number)
48901662808514672388…56758064838009760001
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
4.890 × 10⁹³(94-digit number)
48901662808514672388…56758064838009760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.780 × 10⁹³(94-digit number)
97803325617029344776…13516129676019520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.956 × 10⁹⁴(95-digit number)
19560665123405868955…27032259352039040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.912 × 10⁹⁴(95-digit number)
39121330246811737910…54064518704078080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.824 × 10⁹⁴(95-digit number)
78242660493623475821…08129037408156160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.564 × 10⁹⁵(96-digit number)
15648532098724695164…16258074816312320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.129 × 10⁹⁵(96-digit number)
31297064197449390328…32516149632624640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.259 × 10⁹⁵(96-digit number)
62594128394898780657…65032299265249280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.251 × 10⁹⁶(97-digit number)
12518825678979756131…30064598530498560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.503 × 10⁹⁶(97-digit number)
25037651357959512262…60129197060997120001
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,698,954 XPM·at block #6,806,855 · 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.

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