Block #313,989

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 6:06:46 PM · Difficulty 10.0366 · 6,500,280 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
735d4d95b11292cb23a4edcbb4903a686e3d1b0c3ed8aba55affc7432c8b7fce

Height

#313,989

Difficulty

10.036582

Transactions

5

Size

1.22 KB

Version

2

Bits

0a095d6a

Nonce

78,574

Timestamp

12/15/2013, 6:06:46 PM

Confirmations

6,500,280

Merkle Root

58d13b111596e8fbbf4aea26406986ff370398525d2a39a9ec8eeb3d5823f6f7
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.387 × 10¹⁰⁰(101-digit number)
43878652257076353548…88514587831101152801
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.387 × 10¹⁰⁰(101-digit number)
43878652257076353548…88514587831101152801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.775 × 10¹⁰⁰(101-digit number)
87757304514152707097…77029175662202305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.755 × 10¹⁰¹(102-digit number)
17551460902830541419…54058351324404611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.510 × 10¹⁰¹(102-digit number)
35102921805661082838…08116702648809222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.020 × 10¹⁰¹(102-digit number)
70205843611322165677…16233405297618444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.404 × 10¹⁰²(103-digit number)
14041168722264433135…32466810595236889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.808 × 10¹⁰²(103-digit number)
28082337444528866271…64933621190473779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.616 × 10¹⁰²(103-digit number)
56164674889057732542…29867242380947558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.123 × 10¹⁰³(104-digit number)
11232934977811546508…59734484761895116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.246 × 10¹⁰³(104-digit number)
22465869955623093016…19468969523790233601
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,758,221 XPM·at block #6,814,268 · 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