Block #316,980

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2013, 9:33:09 AM · Difficulty 10.1495 · 6,491,548 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e1066073ca83819467d403c879a2a33af7611c288de7ecb01fba042c670ab77

Height

#316,980

Difficulty

10.149489

Transactions

37

Size

18.85 KB

Version

2

Bits

0a2644e5

Nonce

28,040

Timestamp

12/17/2013, 9:33:09 AM

Confirmations

6,491,548

Merkle Root

9040cf6ce7873750f512437346fe05b6cd096157416d7e9aadafbc1c1ff263de
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.209 × 10¹⁰⁶(107-digit number)
22091427471719280495…92164636618380659841
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.209 × 10¹⁰⁶(107-digit number)
22091427471719280495…92164636618380659841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.418 × 10¹⁰⁶(107-digit number)
44182854943438560990…84329273236761319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.836 × 10¹⁰⁶(107-digit number)
88365709886877121980…68658546473522639361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.767 × 10¹⁰⁷(108-digit number)
17673141977375424396…37317092947045278721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.534 × 10¹⁰⁷(108-digit number)
35346283954750848792…74634185894090557441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.069 × 10¹⁰⁷(108-digit number)
70692567909501697584…49268371788181114881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.413 × 10¹⁰⁸(109-digit number)
14138513581900339516…98536743576362229761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.827 × 10¹⁰⁸(109-digit number)
28277027163800679033…97073487152724459521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.655 × 10¹⁰⁸(109-digit number)
56554054327601358067…94146974305448919041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.131 × 10¹⁰⁹(110-digit number)
11310810865520271613…88293948610897838081
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,712,278 XPM·at block #6,808,527 · 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