Block #392,316

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 9:26:12 AM · Difficulty 10.4373 · 6,432,178 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
baa78832a668dab85a3837a3f133cc7db355a5e6cad4e502ca316efcd114c1b9

Height

#392,316

Difficulty

10.437322

Transactions

7

Size

58.91 KB

Version

2

Bits

0a6ff45a

Nonce

443

Timestamp

2/6/2014, 9:26:12 AM

Confirmations

6,432,178

Merkle Root

6321c52491c26f0dced8d42d02be347a0f332b8458a8d2bb5aaf150c6cf6f262
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.

9.651 × 10¹¹⁰(111-digit number)
96515061209660468374…50199236132685742081
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
9.651 × 10¹¹⁰(111-digit number)
96515061209660468374…50199236132685742081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.930 × 10¹¹¹(112-digit number)
19303012241932093674…00398472265371484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.860 × 10¹¹¹(112-digit number)
38606024483864187349…00796944530742968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.721 × 10¹¹¹(112-digit number)
77212048967728374699…01593889061485936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.544 × 10¹¹²(113-digit number)
15442409793545674939…03187778122971873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.088 × 10¹¹²(113-digit number)
30884819587091349879…06375556245943746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.176 × 10¹¹²(113-digit number)
61769639174182699759…12751112491887493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.235 × 10¹¹³(114-digit number)
12353927834836539951…25502224983774986241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.470 × 10¹¹³(114-digit number)
24707855669673079903…51004449967549972481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.941 × 10¹¹³(114-digit number)
49415711339346159807…02008899935099944961
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,840,024 XPM·at block #6,824,493 · 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