Block #274,290

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 5:40:48 AM · Difficulty 9.9570 · 6,552,435 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3f8c3cac19bbf69533b2dfbdd3000d488006f305c52c88ae2beaa5ef851b3069

Height

#274,290

Difficulty

9.956981

Transactions

5

Size

3.68 KB

Version

2

Bits

09f4fcbc

Nonce

67,087

Timestamp

11/26/2013, 5:40:48 AM

Confirmations

6,552,435

Merkle Root

86e0653f8301dcf60c7e0c212ba81956c00b57b6233654bcbeaee4b13da4b4d7
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.637 × 10⁹⁵(96-digit number)
26371988956086459374…48566540091852513281
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.637 × 10⁹⁵(96-digit number)
26371988956086459374…48566540091852513281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.274 × 10⁹⁵(96-digit number)
52743977912172918749…97133080183705026561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.054 × 10⁹⁶(97-digit number)
10548795582434583749…94266160367410053121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.109 × 10⁹⁶(97-digit number)
21097591164869167499…88532320734820106241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.219 × 10⁹⁶(97-digit number)
42195182329738334999…77064641469640212481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.439 × 10⁹⁶(97-digit number)
84390364659476669998…54129282939280424961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.687 × 10⁹⁷(98-digit number)
16878072931895333999…08258565878560849921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.375 × 10⁹⁷(98-digit number)
33756145863790667999…16517131757121699841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.751 × 10⁹⁷(98-digit number)
67512291727581335998…33034263514243399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.350 × 10⁹⁸(99-digit number)
13502458345516267199…66068527028486799361
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,857,953 XPM·at block #6,826,724 · 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