Block #394,289

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/7/2014, 7:15:37 PM · Difficulty 10.4324 · 6,422,612 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
08563ed281a5cf5b44da43e57fb1fd831c15d64eab372ae3c187037eebe61667

Height

#394,289

Difficulty

10.432352

Transactions

6

Size

15.17 KB

Version

2

Bits

0a6eae99

Nonce

189,639

Timestamp

2/7/2014, 7:15:37 PM

Confirmations

6,422,612

Merkle Root

88e4f57932744496289203db4597896fb0228d9b0edea5bbb123650caf8756ac
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.938 × 10⁹⁷(98-digit number)
19386312986181833753…75269647348306202881
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.938 × 10⁹⁷(98-digit number)
19386312986181833753…75269647348306202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.877 × 10⁹⁷(98-digit number)
38772625972363667507…50539294696612405761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.754 × 10⁹⁷(98-digit number)
77545251944727335014…01078589393224811521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.550 × 10⁹⁸(99-digit number)
15509050388945467002…02157178786449623041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.101 × 10⁹⁸(99-digit number)
31018100777890934005…04314357572899246081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.203 × 10⁹⁸(99-digit number)
62036201555781868011…08628715145798492161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.240 × 10⁹⁹(100-digit number)
12407240311156373602…17257430291596984321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.481 × 10⁹⁹(100-digit number)
24814480622312747204…34514860583193968641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.962 × 10⁹⁹(100-digit number)
49628961244625494409…69029721166387937281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.925 × 10⁹⁹(100-digit number)
99257922489250988818…38059442332775874561
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,779,248 XPM·at block #6,816,900 · 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