Block #316,581

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2013, 4:06:11 AM · Difficulty 10.1372 · 6,499,550 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f1739c4de08e2ed6bc3ee3084844d617c3dac63ad33f6feac207123113b7a0b

Height

#316,581

Difficulty

10.137189

Transactions

7

Size

2.52 KB

Version

2

Bits

0a231ed9

Nonce

12,817

Timestamp

12/17/2013, 4:06:11 AM

Confirmations

6,499,550

Merkle Root

d245a577739bc2bbb0118aaab08df27440e28af5348968fabebdf524a730b5af
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.785 × 10⁹⁷(98-digit number)
47851781416188885104…86164338536644746801
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.785 × 10⁹⁷(98-digit number)
47851781416188885104…86164338536644746801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.570 × 10⁹⁷(98-digit number)
95703562832377770209…72328677073289493601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.914 × 10⁹⁸(99-digit number)
19140712566475554041…44657354146578987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.828 × 10⁹⁸(99-digit number)
38281425132951108083…89314708293157974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.656 × 10⁹⁸(99-digit number)
76562850265902216167…78629416586315948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.531 × 10⁹⁹(100-digit number)
15312570053180443233…57258833172631897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.062 × 10⁹⁹(100-digit number)
30625140106360886466…14517666345263795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.125 × 10⁹⁹(100-digit number)
61250280212721772933…29035332690527590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.225 × 10¹⁰⁰(101-digit number)
12250056042544354586…58070665381055180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.450 × 10¹⁰⁰(101-digit number)
24500112085088709173…16141330762110361601
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,773,174 XPM·at block #6,816,130 · 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