Block #313,283

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 9:54:25 AM · Difficulty 9.9961 · 6,497,734 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
280b605a7459425cc2c0f1a6ae358d1e33c897d9922d42f512687f32ce889a53

Height

#313,283

Difficulty

9.996071

Transactions

1

Size

1.15 KB

Version

2

Bits

09fefe83

Nonce

682

Timestamp

12/15/2013, 9:54:25 AM

Confirmations

6,497,734

Merkle Root

c590400049975f97d668c13e5361e6ca66b30926223dfffcd975a3487de215e3
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.496 × 10⁹⁴(95-digit number)
14963590027723924369…90016526493794150721
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.496 × 10⁹⁴(95-digit number)
14963590027723924369…90016526493794150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.992 × 10⁹⁴(95-digit number)
29927180055447848738…80033052987588301441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.985 × 10⁹⁴(95-digit number)
59854360110895697476…60066105975176602881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.197 × 10⁹⁵(96-digit number)
11970872022179139495…20132211950353205761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.394 × 10⁹⁵(96-digit number)
23941744044358278990…40264423900706411521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.788 × 10⁹⁵(96-digit number)
47883488088716557980…80528847801412823041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.576 × 10⁹⁵(96-digit number)
95766976177433115961…61057695602825646081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.915 × 10⁹⁶(97-digit number)
19153395235486623192…22115391205651292161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.830 × 10⁹⁶(97-digit number)
38306790470973246384…44230782411302584321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.661 × 10⁹⁶(97-digit number)
76613580941946492769…88461564822605168641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.532 × 10⁹⁷(98-digit number)
15322716188389298553…76923129645210337281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,732,242 XPM·at block #6,811,016 · 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