Block #402,986

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2014, 8:16:27 PM · Difficulty 10.4345 · 6,413,099 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
23c14bcba225925e37459e57ba65165c89c42ee9f422fe88aa2323cb7ac49480

Height

#402,986

Difficulty

10.434467

Transactions

7

Size

2.21 KB

Version

2

Bits

0a6f393c

Nonce

7,760,482

Timestamp

2/13/2014, 8:16:27 PM

Confirmations

6,413,099

Merkle Root

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

4.124 × 10⁹⁴(95-digit number)
41240106328843946785…46753795056675069561
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
4.124 × 10⁹⁴(95-digit number)
41240106328843946785…46753795056675069561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.248 × 10⁹⁴(95-digit number)
82480212657687893570…93507590113350139121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.649 × 10⁹⁵(96-digit number)
16496042531537578714…87015180226700278241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.299 × 10⁹⁵(96-digit number)
32992085063075157428…74030360453400556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.598 × 10⁹⁵(96-digit number)
65984170126150314856…48060720906801112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.319 × 10⁹⁶(97-digit number)
13196834025230062971…96121441813602225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.639 × 10⁹⁶(97-digit number)
26393668050460125942…92242883627204451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.278 × 10⁹⁶(97-digit number)
52787336100920251885…84485767254408903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.055 × 10⁹⁷(98-digit number)
10557467220184050377…68971534508817807361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.111 × 10⁹⁷(98-digit number)
21114934440368100754…37943069017635614721
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,772,799 XPM·at block #6,816,084 · 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