Block #404,629

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 11:48:12 PM · Difficulty 10.4339 · 6,405,027 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
37cd1ab1de9155520e14065f7518486e8d5ec4ac21d901d1144be4badec5b5b5

Height

#404,629

Difficulty

10.433895

Transactions

2

Size

413 B

Version

2

Bits

0a6f13b8

Nonce

9,645

Timestamp

2/14/2014, 11:48:12 PM

Confirmations

6,405,027

Merkle Root

9d94022aa06dae4c4c3d72edca8d496859e71d5d322f01984a712b916abafa07
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.024 × 10⁹⁴(95-digit number)
20240424110328870581…92887720112901833921
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.024 × 10⁹⁴(95-digit number)
20240424110328870581…92887720112901833921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.048 × 10⁹⁴(95-digit number)
40480848220657741163…85775440225803667841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.096 × 10⁹⁴(95-digit number)
80961696441315482326…71550880451607335681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.619 × 10⁹⁵(96-digit number)
16192339288263096465…43101760903214671361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.238 × 10⁹⁵(96-digit number)
32384678576526192930…86203521806429342721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.476 × 10⁹⁵(96-digit number)
64769357153052385860…72407043612858685441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.295 × 10⁹⁶(97-digit number)
12953871430610477172…44814087225717370881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.590 × 10⁹⁶(97-digit number)
25907742861220954344…89628174451434741761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.181 × 10⁹⁶(97-digit number)
51815485722441908688…79256348902869483521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.036 × 10⁹⁷(98-digit number)
10363097144488381737…58512697805738967041
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,721,330 XPM·at block #6,809,655 · 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