Block #393,205

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 11:46:07 PM · Difficulty 10.4410 · 6,417,159 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b31e4cb5239f732a29b7d87218002482f18fabdca80d002a6ce8d8127825ac6

Height

#393,205

Difficulty

10.441016

Transactions

5

Size

1.24 KB

Version

2

Bits

0a70e66f

Nonce

22,469

Timestamp

2/6/2014, 11:46:07 PM

Confirmations

6,417,159

Merkle Root

0598f7c37393e497baeb0afbe7e43b5ecd10273af477dc10d33d7b42dc63af15
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.

2.550 × 10⁹⁴(95-digit number)
25503574322649165649…26214411849428098561
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
2.550 × 10⁹⁴(95-digit number)
25503574322649165649…26214411849428098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.100 × 10⁹⁴(95-digit number)
51007148645298331298…52428823698856197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.020 × 10⁹⁵(96-digit number)
10201429729059666259…04857647397712394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.040 × 10⁹⁵(96-digit number)
20402859458119332519…09715294795424788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.080 × 10⁹⁵(96-digit number)
40805718916238665038…19430589590849576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.161 × 10⁹⁵(96-digit number)
81611437832477330077…38861179181699153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.632 × 10⁹⁶(97-digit number)
16322287566495466015…77722358363398307841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.264 × 10⁹⁶(97-digit number)
32644575132990932031…55444716726796615681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.528 × 10⁹⁶(97-digit number)
65289150265981864062…10889433453593231361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.305 × 10⁹⁷(98-digit number)
13057830053196372812…21778866907186462721
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,726,987 XPM·at block #6,810,363 · 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