Block #390,328

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 2:27:43 AM · Difficulty 10.4223 · 6,426,320 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2217e01b887848642227713a2069c4f743da0fd10afc096d5774d6547baf6ccc

Height

#390,328

Difficulty

10.422344

Transactions

7

Size

4.27 KB

Version

2

Bits

0a6c1ebd

Nonce

18,543

Timestamp

2/5/2014, 2:27:43 AM

Confirmations

6,426,320

Merkle Root

6d03dc8371c02d682a6e77fe3e3dfe8d01f8ef78f567a93e8dca3ef4cee24ab4
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.

8.829 × 10⁹⁶(97-digit number)
88297523763323013895…44645733301193904681
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
8.829 × 10⁹⁶(97-digit number)
88297523763323013895…44645733301193904681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.765 × 10⁹⁷(98-digit number)
17659504752664602779…89291466602387809361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.531 × 10⁹⁷(98-digit number)
35319009505329205558…78582933204775618721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.063 × 10⁹⁷(98-digit number)
70638019010658411116…57165866409551237441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.412 × 10⁹⁸(99-digit number)
14127603802131682223…14331732819102474881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.825 × 10⁹⁸(99-digit number)
28255207604263364446…28663465638204949761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.651 × 10⁹⁸(99-digit number)
56510415208526728893…57326931276409899521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.130 × 10⁹⁹(100-digit number)
11302083041705345778…14653862552819799041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.260 × 10⁹⁹(100-digit number)
22604166083410691557…29307725105639598081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.520 × 10⁹⁹(100-digit number)
45208332166821383114…58615450211279196161
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,777,300 XPM·at block #6,816,647 · 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