Block #398,916

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2014, 2:23:29 AM · Difficulty 10.4197 · 6,419,016 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
43eb997b5464b87d4738668febdd474ce7d8710a1ca19201e777fbb8dc3227f2

Height

#398,916

Difficulty

10.419735

Transactions

8

Size

29.14 KB

Version

2

Bits

0a6b73b9

Nonce

1,207,238

Timestamp

2/11/2014, 2:23:29 AM

Confirmations

6,419,016

Merkle Root

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

2.587 × 10⁹⁹(100-digit number)
25874147879062655302…70051064201771427201
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
2.587 × 10⁹⁹(100-digit number)
25874147879062655302…70051064201771427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.174 × 10⁹⁹(100-digit number)
51748295758125310604…40102128403542854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.034 × 10¹⁰⁰(101-digit number)
10349659151625062120…80204256807085708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.069 × 10¹⁰⁰(101-digit number)
20699318303250124241…60408513614171417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.139 × 10¹⁰⁰(101-digit number)
41398636606500248483…20817027228342835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.279 × 10¹⁰⁰(101-digit number)
82797273213000496967…41634054456685670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.655 × 10¹⁰¹(102-digit number)
16559454642600099393…83268108913371340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.311 × 10¹⁰¹(102-digit number)
33118909285200198787…66536217826742681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.623 × 10¹⁰¹(102-digit number)
66237818570400397574…33072435653485363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.324 × 10¹⁰²(103-digit number)
13247563714080079514…66144871306970726401
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,787,523 XPM·at block #6,817,931 · 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