Block #388,893

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/4/2014, 3:48:05 AM · Difficulty 10.4135 · 6,420,455 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0865867846e1e9015757c409fa118fbfaac6e7358078bb82681420fa2eb75157

Height

#388,893

Difficulty

10.413466

Transactions

4

Size

3.00 KB

Version

2

Bits

0a69d8e6

Nonce

8,892

Timestamp

2/4/2014, 3:48:05 AM

Confirmations

6,420,455

Merkle Root

ec935de08fd83248558467def255e51a4cf81bbd39b26fc99ee2ccf8a337807b
Transactions (4)
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.

3.199 × 10⁹⁵(96-digit number)
31999319335871488786…10568648180986877721
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
3.199 × 10⁹⁵(96-digit number)
31999319335871488786…10568648180986877721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.399 × 10⁹⁵(96-digit number)
63998638671742977572…21137296361973755441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.279 × 10⁹⁶(97-digit number)
12799727734348595514…42274592723947510881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.559 × 10⁹⁶(97-digit number)
25599455468697191028…84549185447895021761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.119 × 10⁹⁶(97-digit number)
51198910937394382057…69098370895790043521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.023 × 10⁹⁷(98-digit number)
10239782187478876411…38196741791580087041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.047 × 10⁹⁷(98-digit number)
20479564374957752823…76393483583160174081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.095 × 10⁹⁷(98-digit number)
40959128749915505646…52786967166320348161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.191 × 10⁹⁷(98-digit number)
81918257499831011292…05573934332640696321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.638 × 10⁹⁸(99-digit number)
16383651499966202258…11147868665281392641
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,718,850 XPM·at block #6,809,347 · 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