Block #376,283

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2014, 7:40:36 AM · Difficulty 10.4225 · 6,450,609 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee352db6528fc3142d6a8c1f8a65cd300f98302e3b7c558c9dfb0e328538db8f

Height

#376,283

Difficulty

10.422518

Transactions

4

Size

1.38 KB

Version

2

Bits

0a6c2a25

Nonce

67,261

Timestamp

1/26/2014, 7:40:36 AM

Confirmations

6,450,609

Merkle Root

55c07e184bcab5aa79455775bdce7b93b0a431c92ae79319ba3d9b0e38f35bb9
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.871 × 10⁹⁵(96-digit number)
28719385830570279553…53891857408543293481
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.871 × 10⁹⁵(96-digit number)
28719385830570279553…53891857408543293481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.743 × 10⁹⁵(96-digit number)
57438771661140559106…07783714817086586961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.148 × 10⁹⁶(97-digit number)
11487754332228111821…15567429634173173921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.297 × 10⁹⁶(97-digit number)
22975508664456223642…31134859268346347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.595 × 10⁹⁶(97-digit number)
45951017328912447285…62269718536692695681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.190 × 10⁹⁶(97-digit number)
91902034657824894571…24539437073385391361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.838 × 10⁹⁷(98-digit number)
18380406931564978914…49078874146770782721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.676 × 10⁹⁷(98-digit number)
36760813863129957828…98157748293541565441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.352 × 10⁹⁷(98-digit number)
73521627726259915656…96315496587083130881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.470 × 10⁹⁸(99-digit number)
14704325545251983131…92630993174166261761
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,859,302 XPM·at block #6,826,891 · 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