Block #417,949

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/24/2014, 12:23:16 PM · Difficulty 10.3947 · 6,399,478 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
19d2c32ffee1ec9beba6db8832924c525b2501d3c66b7497c69f620a68c2e8ab

Height

#417,949

Difficulty

10.394663

Transactions

4

Size

1.58 KB

Version

2

Bits

0a6508a3

Nonce

85,903

Timestamp

2/24/2014, 12:23:16 PM

Confirmations

6,399,478

Merkle Root

ce864359b1f3f92df8eee05c3f88821f3f668f2c52edc35336acb55ea6a09aa9
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.782 × 10¹⁰⁰(101-digit number)
67821552982565671607…99675295274962296961
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.782 × 10¹⁰⁰(101-digit number)
67821552982565671607…99675295274962296961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.356 × 10¹⁰¹(102-digit number)
13564310596513134321…99350590549924593921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.712 × 10¹⁰¹(102-digit number)
27128621193026268643…98701181099849187841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.425 × 10¹⁰¹(102-digit number)
54257242386052537286…97402362199698375681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.085 × 10¹⁰²(103-digit number)
10851448477210507457…94804724399396751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.170 × 10¹⁰²(103-digit number)
21702896954421014914…89609448798793502721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.340 × 10¹⁰²(103-digit number)
43405793908842029828…79218897597587005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.681 × 10¹⁰²(103-digit number)
86811587817684059657…58437795195174010881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.736 × 10¹⁰³(104-digit number)
17362317563536811931…16875590390348021761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.472 × 10¹⁰³(104-digit number)
34724635127073623863…33751180780696043521
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,783,462 XPM·at block #6,817,426 · 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