Block #318,460

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 9:13:45 AM · Difficulty 10.1603 · 6,506,060 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a0ae791ed2eaa01c04970397a068aef4def04d346fb8966ccaef6b96a3edec1a

Height

#318,460

Difficulty

10.160289

Transactions

14

Size

7.33 KB

Version

2

Bits

0a2908ad

Nonce

676,771

Timestamp

12/18/2013, 9:13:45 AM

Confirmations

6,506,060

Merkle Root

4f035365855ad89bcbc7041200ed8502423f25df62ee1f43f10de1d6972f8b06
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.146 × 10⁹⁴(95-digit number)
51467938613116696357…43683514009510512321
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.146 × 10⁹⁴(95-digit number)
51467938613116696357…43683514009510512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.029 × 10⁹⁵(96-digit number)
10293587722623339271…87367028019021024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.058 × 10⁹⁵(96-digit number)
20587175445246678543…74734056038042049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.117 × 10⁹⁵(96-digit number)
41174350890493357086…49468112076084098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.234 × 10⁹⁵(96-digit number)
82348701780986714172…98936224152168197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.646 × 10⁹⁶(97-digit number)
16469740356197342834…97872448304336394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.293 × 10⁹⁶(97-digit number)
32939480712394685669…95744896608672788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.587 × 10⁹⁶(97-digit number)
65878961424789371338…91489793217345576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.317 × 10⁹⁷(98-digit number)
13175792284957874267…82979586434691153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.635 × 10⁹⁷(98-digit number)
26351584569915748535…65959172869382307841
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,840,223 XPM·at block #6,824,519 · 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