Block #318,563

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 10:56:04 AM · Difficulty 10.1613 · 6,490,950 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7d5a94a5627aa4027820c6fcd11831a9b2c18587b6651c01b9cf3725ecfcc85

Height

#318,563

Difficulty

10.161262

Transactions

11

Size

25.81 KB

Version

2

Bits

0a294873

Nonce

9,352

Timestamp

12/18/2013, 10:56:04 AM

Confirmations

6,490,950

Merkle Root

4b6b13f9eb2074841cacbf8aad2c0e34a84bbc3e8f0a97a8358c46c01f6ab11a
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.

9.952 × 10¹⁰⁴(105-digit number)
99529753219136520047…28773305492477982721
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
9.952 × 10¹⁰⁴(105-digit number)
99529753219136520047…28773305492477982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.990 × 10¹⁰⁵(106-digit number)
19905950643827304009…57546610984955965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.981 × 10¹⁰⁵(106-digit number)
39811901287654608018…15093221969911930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.962 × 10¹⁰⁵(106-digit number)
79623802575309216037…30186443939823861761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.592 × 10¹⁰⁶(107-digit number)
15924760515061843207…60372887879647723521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.184 × 10¹⁰⁶(107-digit number)
31849521030123686415…20745775759295447041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.369 × 10¹⁰⁶(107-digit number)
63699042060247372830…41491551518590894081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.273 × 10¹⁰⁷(108-digit number)
12739808412049474566…82983103037181788161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.547 × 10¹⁰⁷(108-digit number)
25479616824098949132…65966206074363576321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.095 × 10¹⁰⁷(108-digit number)
50959233648197898264…31932412148727152641
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,720,179 XPM·at block #6,809,512 · 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