Block #313,719

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 2:42:59 PM · Difficulty 10.0238 · 6,494,493 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2802eb686a7269c80a14ea57249444f93c48776fbee92c8f274b00581cf79af1

Height

#313,719

Difficulty

10.023801

Transactions

1

Size

1.11 KB

Version

2

Bits

0a0617d0

Nonce

1,636

Timestamp

12/15/2013, 2:42:59 PM

Confirmations

6,494,493

Merkle Root

9dd9ff5c7ca1d5409b0197cee4c8915db1224138477abc8b00cf91d4dfc764ca
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.283 × 10⁹⁸(99-digit number)
52833681639999398318…65992380965832324521
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.283 × 10⁹⁸(99-digit number)
52833681639999398318…65992380965832324521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.056 × 10⁹⁹(100-digit number)
10566736327999879663…31984761931664649041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.113 × 10⁹⁹(100-digit number)
21133472655999759327…63969523863329298081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.226 × 10⁹⁹(100-digit number)
42266945311999518654…27939047726658596161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.453 × 10⁹⁹(100-digit number)
84533890623999037309…55878095453317192321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.690 × 10¹⁰⁰(101-digit number)
16906778124799807461…11756190906634384641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.381 × 10¹⁰⁰(101-digit number)
33813556249599614923…23512381813268769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.762 × 10¹⁰⁰(101-digit number)
67627112499199229847…47024763626537538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.352 × 10¹⁰¹(102-digit number)
13525422499839845969…94049527253075077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.705 × 10¹⁰¹(102-digit number)
27050844999679691939…88099054506150154241
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,709,747 XPM·at block #6,808,211 · 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