Block #381,878

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/30/2014, 8:04:25 AM · Difficulty 10.4020 · 6,424,434 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a88693b78b9bcb3d07bc8335b1a3cbc491e1dec92defdd7001addc9d5c3829a2

Height

#381,878

Difficulty

10.401976

Transactions

2

Size

1.28 KB

Version

2

Bits

0a66e7e5

Nonce

22,249

Timestamp

1/30/2014, 8:04:25 AM

Confirmations

6,424,434

Merkle Root

6e25d0eeb830a4cf260696a324cdf61a4be1e570eaec7ec08aa393de572100d5
Transactions (2)
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.737 × 10⁹⁹(100-digit number)
27375118870913018362…37957360308808928001
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.737 × 10⁹⁹(100-digit number)
27375118870913018362…37957360308808928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.475 × 10⁹⁹(100-digit number)
54750237741826036724…75914720617617856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.095 × 10¹⁰⁰(101-digit number)
10950047548365207344…51829441235235712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.190 × 10¹⁰⁰(101-digit number)
21900095096730414689…03658882470471424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.380 × 10¹⁰⁰(101-digit number)
43800190193460829379…07317764940942848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.760 × 10¹⁰⁰(101-digit number)
87600380386921658759…14635529881885696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.752 × 10¹⁰¹(102-digit number)
17520076077384331751…29271059763771392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.504 × 10¹⁰¹(102-digit number)
35040152154768663503…58542119527542784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.008 × 10¹⁰¹(102-digit number)
70080304309537327007…17084239055085568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.401 × 10¹⁰²(103-digit number)
14016060861907465401…34168478110171136001
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,694,584 XPM·at block #6,806,311 · 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