Block #398,810

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2014, 12:21:17 AM · Difficulty 10.4222 · 6,412,124 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
71ff9b5193b9cb183081c6552da06c571aab3457eede40646cf65849932d8801

Height

#398,810

Difficulty

10.422237

Transactions

4

Size

3.78 KB

Version

2

Bits

0a6c17bd

Nonce

1,946

Timestamp

2/11/2014, 12:21:17 AM

Confirmations

6,412,124

Merkle Root

0fb200d6d6bbe64b9842d13694e6e8cf5282704f369b98b42735c3a4b9b273c1
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.

1.379 × 10⁹⁷(98-digit number)
13795002999403007661…52796989454728932081
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
1.379 × 10⁹⁷(98-digit number)
13795002999403007661…52796989454728932081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.759 × 10⁹⁷(98-digit number)
27590005998806015323…05593978909457864161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.518 × 10⁹⁷(98-digit number)
55180011997612030647…11187957818915728321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.103 × 10⁹⁸(99-digit number)
11036002399522406129…22375915637831456641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.207 × 10⁹⁸(99-digit number)
22072004799044812258…44751831275662913281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.414 × 10⁹⁸(99-digit number)
44144009598089624517…89503662551325826561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.828 × 10⁹⁸(99-digit number)
88288019196179249035…79007325102651653121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.765 × 10⁹⁹(100-digit number)
17657603839235849807…58014650205303306241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.531 × 10⁹⁹(100-digit number)
35315207678471699614…16029300410606612481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.063 × 10⁹⁹(100-digit number)
70630415356943399228…32058600821213224961
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,731,576 XPM·at block #6,810,933 · 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