Block #396,762

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 2:58:29 PM · Difficulty 10.4153 · 6,413,176 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
38f1dd6a18f6f4e7c6d43f17534e1ecbf167bb0057b5f225107edf3e61b2db77

Height

#396,762

Difficulty

10.415350

Transactions

1

Size

937 B

Version

2

Bits

0a6a545f

Nonce

4,319

Timestamp

2/9/2014, 2:58:29 PM

Confirmations

6,413,176

Merkle Root

6b99b5e3527741638f38227973d32c90d6140dbe81560ab0f05fab7bc3d68fce
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.365 × 10⁹⁹(100-digit number)
53651098355727736775…60021649034256688961
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.365 × 10⁹⁹(100-digit number)
53651098355727736775…60021649034256688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.073 × 10¹⁰⁰(101-digit number)
10730219671145547355…20043298068513377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.146 × 10¹⁰⁰(101-digit number)
21460439342291094710…40086596137026755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.292 × 10¹⁰⁰(101-digit number)
42920878684582189420…80173192274053511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.584 × 10¹⁰⁰(101-digit number)
85841757369164378841…60346384548107023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.716 × 10¹⁰¹(102-digit number)
17168351473832875768…20692769096214046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.433 × 10¹⁰¹(102-digit number)
34336702947665751536…41385538192428093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.867 × 10¹⁰¹(102-digit number)
68673405895331503073…82771076384856186881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.373 × 10¹⁰²(103-digit number)
13734681179066300614…65542152769712373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.746 × 10¹⁰²(103-digit number)
27469362358132601229…31084305539424747521
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,723,592 XPM·at block #6,809,937 · 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