Block #404,254

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 5:21:21 PM · Difficulty 10.4350 · 6,403,726 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5d142fd4750e15a257955fded2b0b6f266595a787384657fa4ef151180eb64dd

Height

#404,254

Difficulty

10.434963

Transactions

4

Size

1.60 KB

Version

2

Bits

0a6f59bc

Nonce

56,675

Timestamp

2/14/2014, 5:21:21 PM

Confirmations

6,403,726

Merkle Root

5196b870dd82aa2232604681a8ba376135733ec3f53c98d62f0e9ce5f3836ef2
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.

6.640 × 10⁹⁹(100-digit number)
66407293295164726496…62753460358213734401
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
6.640 × 10⁹⁹(100-digit number)
66407293295164726496…62753460358213734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.328 × 10¹⁰⁰(101-digit number)
13281458659032945299…25506920716427468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.656 × 10¹⁰⁰(101-digit number)
26562917318065890598…51013841432854937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.312 × 10¹⁰⁰(101-digit number)
53125834636131781197…02027682865709875201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.062 × 10¹⁰¹(102-digit number)
10625166927226356239…04055365731419750401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.125 × 10¹⁰¹(102-digit number)
21250333854452712478…08110731462839500801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.250 × 10¹⁰¹(102-digit number)
42500667708905424957…16221462925679001601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.500 × 10¹⁰¹(102-digit number)
85001335417810849915…32442925851358003201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.700 × 10¹⁰²(103-digit number)
17000267083562169983…64885851702716006401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.400 × 10¹⁰²(103-digit number)
34000534167124339966…29771703405432012801
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,707,885 XPM·at block #6,807,979 · 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