Block #388,885

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/4/2014, 3:35:44 AM · Difficulty 10.4136 · 6,428,980 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab4340ed9668f42a05bd6ad0fd32833afff4d5b233bef4d2ba80c48431a8db8c

Height

#388,885

Difficulty

10.413591

Transactions

6

Size

2.33 KB

Version

2

Bits

0a69e113

Nonce

68,517

Timestamp

2/4/2014, 3:35:44 AM

Confirmations

6,428,980

Merkle Root

0c194706ff62f44b96c1a4899f8a945d65cf09c502268586bf6ea11f1e5a43b7
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.

5.999 × 10⁹⁶(97-digit number)
59998541854308780258…49260388730387248921
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
5.999 × 10⁹⁶(97-digit number)
59998541854308780258…49260388730387248921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.199 × 10⁹⁷(98-digit number)
11999708370861756051…98520777460774497841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.399 × 10⁹⁷(98-digit number)
23999416741723512103…97041554921548995681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.799 × 10⁹⁷(98-digit number)
47998833483447024207…94083109843097991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.599 × 10⁹⁷(98-digit number)
95997666966894048414…88166219686195982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.919 × 10⁹⁸(99-digit number)
19199533393378809682…76332439372391965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.839 × 10⁹⁸(99-digit number)
38399066786757619365…52664878744783930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.679 × 10⁹⁸(99-digit number)
76798133573515238731…05329757489567861761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.535 × 10⁹⁹(100-digit number)
15359626714703047746…10659514979135723521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.071 × 10⁹⁹(100-digit number)
30719253429406095492…21319029958271447041
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,786,987 XPM·at block #6,817,864 · 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