Block #406,240

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 3:20:45 AM · Difficulty 10.4304 · 6,424,210 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
491af63cb8e2652a7a9eb5531089b74298b5772208718f86739b403ab6e88209

Height

#406,240

Difficulty

10.430412

Transactions

2

Size

1.68 KB

Version

2

Bits

0a6e2f7c

Nonce

86,600

Timestamp

2/16/2014, 3:20:45 AM

Confirmations

6,424,210

Merkle Root

1f36597a23b2a8de3f5300b2bad6aeb35162ba6e9b23b353cfe5d7ae03573f49
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.

8.337 × 10⁹⁷(98-digit number)
83376565189829447221…25961939700923974621
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
8.337 × 10⁹⁷(98-digit number)
83376565189829447221…25961939700923974621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.667 × 10⁹⁸(99-digit number)
16675313037965889444…51923879401847949241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.335 × 10⁹⁸(99-digit number)
33350626075931778888…03847758803695898481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.670 × 10⁹⁸(99-digit number)
66701252151863557776…07695517607391796961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.334 × 10⁹⁹(100-digit number)
13340250430372711555…15391035214783593921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.668 × 10⁹⁹(100-digit number)
26680500860745423110…30782070429567187841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.336 × 10⁹⁹(100-digit number)
53361001721490846221…61564140859134375681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.067 × 10¹⁰⁰(101-digit number)
10672200344298169244…23128281718268751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.134 × 10¹⁰⁰(101-digit number)
21344400688596338488…46256563436537502721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.268 × 10¹⁰⁰(101-digit number)
42688801377192676977…92513126873075005441
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,887,845 XPM·at block #6,830,449 · 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