Block #397,472

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2014, 3:15:55 AM · Difficulty 10.4123 · 6,419,093 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
257a113861d637c52d11ee6d6bd88b9e41858b4a07a7bf08e2304544fb39d8e2

Height

#397,472

Difficulty

10.412259

Transactions

5

Size

2.83 KB

Version

2

Bits

0a6989ce

Nonce

56,216

Timestamp

2/10/2014, 3:15:55 AM

Confirmations

6,419,093

Merkle Root

f202bc3c3670ddf59ec6f7fbbc16344d50bb826bfea1c4ff12623af4b1d505e2
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.

2.829 × 10¹⁰⁴(105-digit number)
28292567505249721353…15541921753539040001
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
2.829 × 10¹⁰⁴(105-digit number)
28292567505249721353…15541921753539040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.658 × 10¹⁰⁴(105-digit number)
56585135010499442707…31083843507078080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.131 × 10¹⁰⁵(106-digit number)
11317027002099888541…62167687014156160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.263 × 10¹⁰⁵(106-digit number)
22634054004199777082…24335374028312320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.526 × 10¹⁰⁵(106-digit number)
45268108008399554165…48670748056624640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.053 × 10¹⁰⁵(106-digit number)
90536216016799108331…97341496113249280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.810 × 10¹⁰⁶(107-digit number)
18107243203359821666…94682992226498560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.621 × 10¹⁰⁶(107-digit number)
36214486406719643332…89365984452997120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.242 × 10¹⁰⁶(107-digit number)
72428972813439286665…78731968905994240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.448 × 10¹⁰⁷(108-digit number)
14485794562687857333…57463937811988480001
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,776,651 XPM·at block #6,816,564 · 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