Block #400,783

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 8:09:32 AM · Difficulty 10.4300 · 6,415,913 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
64669bbe7424a8b98fee94fdd792ca581373ef9b4a656744862c8744a9247a56

Height

#400,783

Difficulty

10.430021

Transactions

6

Size

3.33 KB

Version

2

Bits

0a6e15de

Nonce

378,987

Timestamp

2/12/2014, 8:09:32 AM

Confirmations

6,415,913

Merkle Root

be11796829c0ef75257090eeb8b462ee591385456d2aecd0e12d3f099094fd74
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.687 × 10⁹¹(92-digit number)
76879019155517781842…61608749586454300101
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.687 × 10⁹¹(92-digit number)
76879019155517781842…61608749586454300101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.537 × 10⁹²(93-digit number)
15375803831103556368…23217499172908600201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.075 × 10⁹²(93-digit number)
30751607662207112737…46434998345817200401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.150 × 10⁹²(93-digit number)
61503215324414225474…92869996691634400801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.230 × 10⁹³(94-digit number)
12300643064882845094…85739993383268801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.460 × 10⁹³(94-digit number)
24601286129765690189…71479986766537603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.920 × 10⁹³(94-digit number)
49202572259531380379…42959973533075206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.840 × 10⁹³(94-digit number)
98405144519062760758…85919947066150412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.968 × 10⁹⁴(95-digit number)
19681028903812552151…71839894132300825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.936 × 10⁹⁴(95-digit number)
39362057807625104303…43679788264601651201
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,777,690 XPM·at block #6,816,695 · 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