Block #397,787

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2014, 7:51:20 AM · Difficulty 10.4171 · 6,414,768 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6be832bad31fcb2e997ec74b003992cae547ac53091ef0373be8fd3d374e099

Height

#397,787

Difficulty

10.417057

Transactions

6

Size

1.23 KB

Version

2

Bits

0a6ac438

Nonce

25,570

Timestamp

2/10/2014, 7:51:20 AM

Confirmations

6,414,768

Merkle Root

63fa84dcec7280cb987cdc597e7c82d87d0e7c4d809eefe01c8abbe080a34cae
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.

5.809 × 10⁹⁸(99-digit number)
58097274245716318566…38709642055291445761
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
5.809 × 10⁹⁸(99-digit number)
58097274245716318566…38709642055291445761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.161 × 10⁹⁹(100-digit number)
11619454849143263713…77419284110582891521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.323 × 10⁹⁹(100-digit number)
23238909698286527426…54838568221165783041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.647 × 10⁹⁹(100-digit number)
46477819396573054852…09677136442331566081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.295 × 10⁹⁹(100-digit number)
92955638793146109705…19354272884663132161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.859 × 10¹⁰⁰(101-digit number)
18591127758629221941…38708545769326264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.718 × 10¹⁰⁰(101-digit number)
37182255517258443882…77417091538652528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.436 × 10¹⁰⁰(101-digit number)
74364511034516887764…54834183077305057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.487 × 10¹⁰¹(102-digit number)
14872902206903377552…09668366154610114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.974 × 10¹⁰¹(102-digit number)
29745804413806755105…19336732309220229121
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,744,473 XPM·at block #6,812,554 · 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