Block #378,232

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/27/2014, 4:14:44 PM · Difficulty 10.4225 · 6,436,801 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d02a5633924be6c966afae055906972152f5b873948f492c19e1415c11b61249

Height

#378,232

Difficulty

10.422463

Transactions

6

Size

1.30 KB

Version

2

Bits

0a6c2686

Nonce

117,443,957

Timestamp

1/27/2014, 4:14:44 PM

Confirmations

6,436,801

Merkle Root

cc20e00ea8779bc29a6fae67b69f825138c8e33273383f03b89cda86273d0644
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.821 × 10⁹⁷(98-digit number)
18217246591291750746…98860693573455718401
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.821 × 10⁹⁷(98-digit number)
18217246591291750746…98860693573455718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.643 × 10⁹⁷(98-digit number)
36434493182583501492…97721387146911436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.286 × 10⁹⁷(98-digit number)
72868986365167002984…95442774293822873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.457 × 10⁹⁸(99-digit number)
14573797273033400596…90885548587645747201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.914 × 10⁹⁸(99-digit number)
29147594546066801193…81771097175291494401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.829 × 10⁹⁸(99-digit number)
58295189092133602387…63542194350582988801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.165 × 10⁹⁹(100-digit number)
11659037818426720477…27084388701165977601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.331 × 10⁹⁹(100-digit number)
23318075636853440955…54168777402331955201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.663 × 10⁹⁹(100-digit number)
46636151273706881910…08337554804663910401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.327 × 10⁹⁹(100-digit number)
93272302547413763820…16675109609327820801
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,764,354 XPM·at block #6,815,032 · 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