Block #404,104

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 2:56:16 PM · Difficulty 10.4351 · 6,422,893 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
76766c3a9c38b43b6adf005618655867582c17f1dcd917bf28f07e4ed8d7be3a

Height

#404,104

Difficulty

10.435128

Transactions

12

Size

2.91 KB

Version

2

Bits

0a6f6491

Nonce

12,937

Timestamp

2/14/2014, 2:56:16 PM

Confirmations

6,422,893

Merkle Root

0081a0506ff12a10caeaf66793d337a3d8f0cb2963a66f6603b233728c8e1678
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.335 × 10¹⁰⁰(101-digit number)
23354316705516472758…69222785126636850201
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.335 × 10¹⁰⁰(101-digit number)
23354316705516472758…69222785126636850201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.670 × 10¹⁰⁰(101-digit number)
46708633411032945516…38445570253273700401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.341 × 10¹⁰⁰(101-digit number)
93417266822065891032…76891140506547400801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.868 × 10¹⁰¹(102-digit number)
18683453364413178206…53782281013094801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.736 × 10¹⁰¹(102-digit number)
37366906728826356413…07564562026189603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.473 × 10¹⁰¹(102-digit number)
74733813457652712826…15129124052379206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.494 × 10¹⁰²(103-digit number)
14946762691530542565…30258248104758412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.989 × 10¹⁰²(103-digit number)
29893525383061085130…60516496209516825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.978 × 10¹⁰²(103-digit number)
59787050766122170260…21032992419033651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.195 × 10¹⁰³(104-digit number)
11957410153224434052…42065984838067302401
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,860,152 XPM·at block #6,826,996 · 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