Block #379,221

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/28/2014, 9:35:19 AM · Difficulty 10.4166 · 6,430,302 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a6dcd123bfe0b0f4eb9935781ca81370b8af709cf3195554bfce78bb826d56f8

Height

#379,221

Difficulty

10.416551

Transactions

14

Size

3.05 KB

Version

2

Bits

0a6aa31b

Nonce

76,876

Timestamp

1/28/2014, 9:35:19 AM

Confirmations

6,430,302

Merkle Root

427fe8edb4402b7270687858cbea915a08b8ade49c6c555c871cdf6ec6ef92c2
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.

1.235 × 10⁹⁶(97-digit number)
12353492382788173145…77759165516410039361
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
1.235 × 10⁹⁶(97-digit number)
12353492382788173145…77759165516410039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.470 × 10⁹⁶(97-digit number)
24706984765576346290…55518331032820078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.941 × 10⁹⁶(97-digit number)
49413969531152692581…11036662065640157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.882 × 10⁹⁶(97-digit number)
98827939062305385163…22073324131280314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.976 × 10⁹⁷(98-digit number)
19765587812461077032…44146648262560629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.953 × 10⁹⁷(98-digit number)
39531175624922154065…88293296525121259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.906 × 10⁹⁷(98-digit number)
79062351249844308130…76586593050242519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.581 × 10⁹⁸(99-digit number)
15812470249968861626…53173186100485038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.162 × 10⁹⁸(99-digit number)
31624940499937723252…06346372200970076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.324 × 10⁹⁸(99-digit number)
63249880999875446504…12692744401940152321
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,720,261 XPM·at block #6,809,522 · 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