Block #395,989

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 3:02:59 AM · Difficulty 10.4087 · 6,420,626 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32ce45139c6c790a8ac5e267ea39b7f1b16631ed7d78a49c714ad3439847966f

Height

#395,989

Difficulty

10.408724

Transactions

3

Size

802 B

Version

2

Bits

0a68a22b

Nonce

196,977

Timestamp

2/9/2014, 3:02:59 AM

Confirmations

6,420,626

Merkle Root

9be0ec5a999d94e95c55890821471be2d389f35462c5097fa1ade0bca1f70c7d
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.

7.447 × 10⁹⁶(97-digit number)
74477572232187099843…82231549285026923661
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
7.447 × 10⁹⁶(97-digit number)
74477572232187099843…82231549285026923661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.489 × 10⁹⁷(98-digit number)
14895514446437419968…64463098570053847321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.979 × 10⁹⁷(98-digit number)
29791028892874839937…28926197140107694641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.958 × 10⁹⁷(98-digit number)
59582057785749679875…57852394280215389281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.191 × 10⁹⁸(99-digit number)
11916411557149935975…15704788560430778561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.383 × 10⁹⁸(99-digit number)
23832823114299871950…31409577120861557121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.766 × 10⁹⁸(99-digit number)
47665646228599743900…62819154241723114241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.533 × 10⁹⁸(99-digit number)
95331292457199487800…25638308483446228481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.906 × 10⁹⁹(100-digit number)
19066258491439897560…51276616966892456961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.813 × 10⁹⁹(100-digit number)
38132516982879795120…02553233933784913921
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,042 XPM·at block #6,816,614 · 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