Block #393,198

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 11:31:03 PM · Difficulty 10.4419 · 6,413,183 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f76d411043175258228d98c9912bf54d57b2c009f83fc0353b196da76cf0e508

Height

#393,198

Difficulty

10.441934

Transactions

8

Size

2.00 KB

Version

2

Bits

0a71228e

Nonce

64,974

Timestamp

2/6/2014, 11:31:03 PM

Confirmations

6,413,183

Merkle Root

f9dc62f8d980206ee8b8fddff01d5ae763bd4e18af311e84c028cbf056dcde98
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.492 × 10⁹⁸(99-digit number)
54927327053437490109…56639399808389056001
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.492 × 10⁹⁸(99-digit number)
54927327053437490109…56639399808389056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.098 × 10⁹⁹(100-digit number)
10985465410687498021…13278799616778112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.197 × 10⁹⁹(100-digit number)
21970930821374996043…26557599233556224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.394 × 10⁹⁹(100-digit number)
43941861642749992087…53115198467112448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.788 × 10⁹⁹(100-digit number)
87883723285499984175…06230396934224896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.757 × 10¹⁰⁰(101-digit number)
17576744657099996835…12460793868449792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.515 × 10¹⁰⁰(101-digit number)
35153489314199993670…24921587736899584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.030 × 10¹⁰⁰(101-digit number)
70306978628399987340…49843175473799168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.406 × 10¹⁰¹(102-digit number)
14061395725679997468…99686350947598336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.812 × 10¹⁰¹(102-digit number)
28122791451359994936…99372701895196672001
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,695,137 XPM·at block #6,806,380 · 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