Block #390,709

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 8:22:48 AM · Difficulty 10.4253 · 6,427,208 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4512b26f298f3e3edadd04040f37ea7155cd25997ad1d116160ff9a29f31b10b

Height

#390,709

Difficulty

10.425310

Transactions

6

Size

1.30 KB

Version

2

Bits

0a6ce120

Nonce

29,031

Timestamp

2/5/2014, 8:22:48 AM

Confirmations

6,427,208

Merkle Root

5bff72f29862105922b3ef400413944850a375abf871be3fb600169d2128b663
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.560 × 10⁹⁶(97-digit number)
35600313617189989503…20994523406720281601
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.560 × 10⁹⁶(97-digit number)
35600313617189989503…20994523406720281601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.120 × 10⁹⁶(97-digit number)
71200627234379979007…41989046813440563201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.424 × 10⁹⁷(98-digit number)
14240125446875995801…83978093626881126401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.848 × 10⁹⁷(98-digit number)
28480250893751991602…67956187253762252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.696 × 10⁹⁷(98-digit number)
56960501787503983205…35912374507524505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.139 × 10⁹⁸(99-digit number)
11392100357500796641…71824749015049011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.278 × 10⁹⁸(99-digit number)
22784200715001593282…43649498030098022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.556 × 10⁹⁸(99-digit number)
45568401430003186564…87298996060196044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.113 × 10⁹⁸(99-digit number)
91136802860006373129…74597992120392089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.822 × 10⁹⁹(100-digit number)
18227360572001274625…49195984240784179201
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,787,401 XPM·at block #6,817,916 · 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