Block #397,077

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 8:12:38 PM · Difficulty 10.4155 · 6,441,932 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
824dc1cf07de189096703d813115727ea41018ac48c63697fd449007f4d57063

Height

#397,077

Difficulty

10.415537

Transactions

2

Size

437 B

Version

2

Bits

0a6a60a8

Nonce

5,477

Timestamp

2/9/2014, 8:12:38 PM

Confirmations

6,441,932

Merkle Root

8b036336de7e2c707677f81d7278cfe6b2f58f6662d305feab578db55a5324da
Transactions (2)
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.269 × 10¹⁰⁴(105-digit number)
72692078840322175816…25437698848430489601
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.269 × 10¹⁰⁴(105-digit number)
72692078840322175816…25437698848430489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.453 × 10¹⁰⁵(106-digit number)
14538415768064435163…50875397696860979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.907 × 10¹⁰⁵(106-digit number)
29076831536128870326…01750795393721958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.815 × 10¹⁰⁵(106-digit number)
58153663072257740652…03501590787443916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.163 × 10¹⁰⁶(107-digit number)
11630732614451548130…07003181574887833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.326 × 10¹⁰⁶(107-digit number)
23261465228903096261…14006363149775667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.652 × 10¹⁰⁶(107-digit number)
46522930457806192522…28012726299551334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.304 × 10¹⁰⁶(107-digit number)
93045860915612385044…56025452599102668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.860 × 10¹⁰⁷(108-digit number)
18609172183122477008…12050905198205337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.721 × 10¹⁰⁷(108-digit number)
37218344366244954017…24101810396410675201
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,956,338 XPM·at block #6,839,008 · 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