Block #316,849

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2013, 7:47:57 AM · Difficulty 10.1470 · 6,499,339 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c725babf8a6bcf50c41d77239f94f61e93e9ca76b8b55d707ce9758fa1bf9b9b

Height

#316,849

Difficulty

10.146975

Transactions

10

Size

3.68 KB

Version

2

Bits

0a25a024

Nonce

4,830

Timestamp

12/17/2013, 7:47:57 AM

Confirmations

6,499,339

Merkle Root

6ee465d204cceccec314846cb376ab8a629b5d93f7dada947f97938ffd77a6d2
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.539 × 10⁹⁶(97-digit number)
35396255860948490448…59000446763249090721
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.539 × 10⁹⁶(97-digit number)
35396255860948490448…59000446763249090721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.079 × 10⁹⁶(97-digit number)
70792511721896980897…18000893526498181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.415 × 10⁹⁷(98-digit number)
14158502344379396179…36001787052996362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.831 × 10⁹⁷(98-digit number)
28317004688758792358…72003574105992725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.663 × 10⁹⁷(98-digit number)
56634009377517584717…44007148211985451521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.132 × 10⁹⁸(99-digit number)
11326801875503516943…88014296423970903041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.265 × 10⁹⁸(99-digit number)
22653603751007033887…76028592847941806081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.530 × 10⁹⁸(99-digit number)
45307207502014067774…52057185695883612161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.061 × 10⁹⁸(99-digit number)
90614415004028135548…04114371391767224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.812 × 10⁹⁹(100-digit number)
18122883000805627109…08228742783534448641
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,628 XPM·at block #6,816,187 · 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