Block #399,664

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2014, 1:30:49 PM · Difficulty 10.4291 · 6,410,678 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ca696400ebd16c687ed466e1a79d1727d673ac74941a25a12519431f2fe3f067

Height

#399,664

Difficulty

10.429085

Transactions

3

Size

3.64 KB

Version

2

Bits

0a6dd88b

Nonce

1,123

Timestamp

2/11/2014, 1:30:49 PM

Confirmations

6,410,678

Merkle Root

0586f99795f28ec89254429da3a9680341718f6f4fa07c70f3f68fe41a845359
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.

9.279 × 10¹⁰⁷(108-digit number)
92790657122090464400…09943945662982400001
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
9.279 × 10¹⁰⁷(108-digit number)
92790657122090464400…09943945662982400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.855 × 10¹⁰⁸(109-digit number)
18558131424418092880…19887891325964800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.711 × 10¹⁰⁸(109-digit number)
37116262848836185760…39775782651929600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.423 × 10¹⁰⁸(109-digit number)
74232525697672371520…79551565303859200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.484 × 10¹⁰⁹(110-digit number)
14846505139534474304…59103130607718400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.969 × 10¹⁰⁹(110-digit number)
29693010279068948608…18206261215436800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.938 × 10¹⁰⁹(110-digit number)
59386020558137897216…36412522430873600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.187 × 10¹¹⁰(111-digit number)
11877204111627579443…72825044861747200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.375 × 10¹¹⁰(111-digit number)
23754408223255158886…45650089723494400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.750 × 10¹¹⁰(111-digit number)
47508816446510317772…91300179446988800001
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,726,818 XPM·at block #6,810,341 · 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