Block #316,707

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2013, 5:43:44 AM · Difficulty 10.1420 · 6,492,870 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d277a4be96cc938771a1c3df1f254c1c837ab4312e7ded97974d2174546fa5cd

Height

#316,707

Difficulty

10.141953

Transactions

1

Size

1.08 KB

Version

2

Bits

0a245706

Nonce

11,476

Timestamp

12/17/2013, 5:43:44 AM

Confirmations

6,492,870

Merkle Root

c3e3f3d9d5e79ced601436f36dca6031024abd045478774f2346a91ac5c38d49
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.

3.762 × 10⁹⁶(97-digit number)
37628257677404554685…16861702446956098041
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
3.762 × 10⁹⁶(97-digit number)
37628257677404554685…16861702446956098041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.525 × 10⁹⁶(97-digit number)
75256515354809109371…33723404893912196081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.505 × 10⁹⁷(98-digit number)
15051303070961821874…67446809787824392161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.010 × 10⁹⁷(98-digit number)
30102606141923643748…34893619575648784321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.020 × 10⁹⁷(98-digit number)
60205212283847287496…69787239151297568641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.204 × 10⁹⁸(99-digit number)
12041042456769457499…39574478302595137281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.408 × 10⁹⁸(99-digit number)
24082084913538914998…79148956605190274561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.816 × 10⁹⁸(99-digit number)
48164169827077829997…58297913210380549121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.632 × 10⁹⁸(99-digit number)
96328339654155659995…16595826420761098241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.926 × 10⁹⁹(100-digit number)
19265667930831131999…33191652841522196481
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,693 XPM·at block #6,809,576 · 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