Block #427,302

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 7:07:22 AM · Difficulty 10.3472 · 6,389,547 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bc6fb5f5dc3a74fe5e75199a9bf955847318bd2a740d26123bf57e33d9c04cb8

Height

#427,302

Difficulty

10.347231

Transactions

2

Size

1.16 KB

Version

2

Bits

0a58e427

Nonce

138,906

Timestamp

3/3/2014, 7:07:22 AM

Confirmations

6,389,547

Merkle Root

a2d44feaa21c6053b15e7b2728c66b63877b98b15e310d76f5e3e2facbc36c5d
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.

4.488 × 10⁹¹(92-digit number)
44884879513459125614…39018053498628032561
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
4.488 × 10⁹¹(92-digit number)
44884879513459125614…39018053498628032561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.976 × 10⁹¹(92-digit number)
89769759026918251229…78036106997256065121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.795 × 10⁹²(93-digit number)
17953951805383650245…56072213994512130241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.590 × 10⁹²(93-digit number)
35907903610767300491…12144427989024260481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.181 × 10⁹²(93-digit number)
71815807221534600983…24288855978048520961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.436 × 10⁹³(94-digit number)
14363161444306920196…48577711956097041921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.872 × 10⁹³(94-digit number)
28726322888613840393…97155423912194083841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.745 × 10⁹³(94-digit number)
57452645777227680787…94310847824388167681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.149 × 10⁹⁴(95-digit number)
11490529155445536157…88621695648776335361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.298 × 10⁹⁴(95-digit number)
22981058310891072314…77243391297552670721
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,778,834 XPM·at block #6,816,848 · 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