Block #407,124

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 5:41:20 PM · Difficulty 10.4335 · 6,402,799 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a4c7b3135ed821d334c66afa0fe9adf4f132dc3deb8224dd7c6a32e7486cbc24

Height

#407,124

Difficulty

10.433485

Transactions

2

Size

4.61 KB

Version

2

Bits

0a6ef8df

Nonce

101,773

Timestamp

2/16/2014, 5:41:20 PM

Confirmations

6,402,799

Merkle Root

4fe083511f684beb5d860a781fb84224a01f0808e53aa98caf48c6c733a70100
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.

2.824 × 10¹⁰⁴(105-digit number)
28248198242491120548…17508783938298020801
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.824 × 10¹⁰⁴(105-digit number)
28248198242491120548…17508783938298020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.649 × 10¹⁰⁴(105-digit number)
56496396484982241097…35017567876596041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.129 × 10¹⁰⁵(106-digit number)
11299279296996448219…70035135753192083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.259 × 10¹⁰⁵(106-digit number)
22598558593992896438…40070271506384166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.519 × 10¹⁰⁵(106-digit number)
45197117187985792877…80140543012768332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.039 × 10¹⁰⁵(106-digit number)
90394234375971585755…60281086025536665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.807 × 10¹⁰⁶(107-digit number)
18078846875194317151…20562172051073331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.615 × 10¹⁰⁶(107-digit number)
36157693750388634302…41124344102146662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.231 × 10¹⁰⁶(107-digit number)
72315387500777268604…82248688204293324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.446 × 10¹⁰⁷(108-digit number)
14463077500155453720…64497376408586649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.892 × 10¹⁰⁷(108-digit number)
28926155000310907441…28994752817173299201
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,470 XPM·at block #6,809,922 · 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