Block #376,206

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2014, 6:31:19 AM · Difficulty 10.4218 · 6,431,254 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f07ba48ffc39fb6c2f768b7b21f9965b484d09654984b45b59de110c0d01aa6

Height

#376,206

Difficulty

10.421768

Transactions

5

Size

3.69 KB

Version

2

Bits

0a6bf8fc

Nonce

15,877

Timestamp

1/26/2014, 6:31:19 AM

Confirmations

6,431,254

Merkle Root

30278718adc8f2e1ff900d0cc4f24937bd607e08aee876a4ffafdb3ad867c8a5
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.

8.083 × 10⁹⁷(98-digit number)
80839389833907769767…14620368013781502081
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
8.083 × 10⁹⁷(98-digit number)
80839389833907769767…14620368013781502081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.616 × 10⁹⁸(99-digit number)
16167877966781553953…29240736027563004161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.233 × 10⁹⁸(99-digit number)
32335755933563107906…58481472055126008321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.467 × 10⁹⁸(99-digit number)
64671511867126215813…16962944110252016641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.293 × 10⁹⁹(100-digit number)
12934302373425243162…33925888220504033281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.586 × 10⁹⁹(100-digit number)
25868604746850486325…67851776441008066561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.173 × 10⁹⁹(100-digit number)
51737209493700972650…35703552882016133121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.034 × 10¹⁰⁰(101-digit number)
10347441898740194530…71407105764032266241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.069 × 10¹⁰⁰(101-digit number)
20694883797480389060…42814211528064532481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.138 × 10¹⁰⁰(101-digit number)
41389767594960778120…85628423056129064961
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,703,704 XPM·at block #6,807,459 · 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