Block #438,713

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 5:14:59 AM · Difficulty 10.3546 · 6,377,240 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c62ccf733af86403549fd5beeea9205a162808367deda9e1316bf8a7d5f0615

Height

#438,713

Difficulty

10.354638

Transactions

1

Size

1006 B

Version

2

Bits

0a5ac992

Nonce

43,218

Timestamp

3/11/2014, 5:14:59 AM

Confirmations

6,377,240

Merkle Root

97189d802114f55514b0ea24fd0e93a73acd91d013195c328f3aadb826f4fe77
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.

1.433 × 10¹⁰¹(102-digit number)
14331116454694567843…04169641530011863041
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
1.433 × 10¹⁰¹(102-digit number)
14331116454694567843…04169641530011863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.866 × 10¹⁰¹(102-digit number)
28662232909389135687…08339283060023726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.732 × 10¹⁰¹(102-digit number)
57324465818778271375…16678566120047452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.146 × 10¹⁰²(103-digit number)
11464893163755654275…33357132240094904321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.292 × 10¹⁰²(103-digit number)
22929786327511308550…66714264480189808641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.585 × 10¹⁰²(103-digit number)
45859572655022617100…33428528960379617281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.171 × 10¹⁰²(103-digit number)
91719145310045234201…66857057920759234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.834 × 10¹⁰³(104-digit number)
18343829062009046840…33714115841518469121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.668 × 10¹⁰³(104-digit number)
36687658124018093680…67428231683036938241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.337 × 10¹⁰³(104-digit number)
73375316248036187361…34856463366073876481
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,771,737 XPM·at block #6,815,952 · 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