Block #411,811

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/20/2014, 2:27:59 AM · Difficulty 10.4165 · 6,404,657 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5692041fd049907c9539838804a33f061331c204a4da862bf7ac9a1600057018

Height

#411,811

Difficulty

10.416533

Transactions

2

Size

1.14 KB

Version

2

Bits

0a6aa1e8

Nonce

143,246

Timestamp

2/20/2014, 2:27:59 AM

Confirmations

6,404,657

Merkle Root

cda4b81b86e0a24937ce167c0b54e5607ce3500849c7fea341c92e6f240d01f6
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.567 × 10⁹⁴(95-digit number)
15672340283713886969…64039035764368180801
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.567 × 10⁹⁴(95-digit number)
15672340283713886969…64039035764368180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.134 × 10⁹⁴(95-digit number)
31344680567427773938…28078071528736361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.268 × 10⁹⁴(95-digit number)
62689361134855547876…56156143057472723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.253 × 10⁹⁵(96-digit number)
12537872226971109575…12312286114945446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.507 × 10⁹⁵(96-digit number)
25075744453942219150…24624572229890892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.015 × 10⁹⁵(96-digit number)
50151488907884438301…49249144459781785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.003 × 10⁹⁶(97-digit number)
10030297781576887660…98498288919563571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.006 × 10⁹⁶(97-digit number)
20060595563153775320…96996577839127142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.012 × 10⁹⁶(97-digit number)
40121191126307550640…93993155678254284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.024 × 10⁹⁶(97-digit number)
80242382252615101281…87986311356508569601
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,775,873 XPM·at block #6,816,467 · 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