Block #405,964

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/15/2014, 10:09:50 PM · Difficulty 10.4343 · 6,404,559 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d0092a07130d907fd583979f48b219c8847d8f4cbd060f749304a3f9dcc8e570

Height

#405,964

Difficulty

10.434272

Transactions

10

Size

7.27 KB

Version

2

Bits

0a6f2c74

Nonce

73,376

Timestamp

2/15/2014, 10:09:50 PM

Confirmations

6,404,559

Merkle Root

06f007a36e085e129d36025cce06369a291989fee631a2af0bc439502901ae9c
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.353 × 10⁹⁶(97-digit number)
83536957801707623115…99814636697600658001
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.353 × 10⁹⁶(97-digit number)
83536957801707623115…99814636697600658001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.670 × 10⁹⁷(98-digit number)
16707391560341524623…99629273395201316001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.341 × 10⁹⁷(98-digit number)
33414783120683049246…99258546790402632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.682 × 10⁹⁷(98-digit number)
66829566241366098492…98517093580805264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.336 × 10⁹⁸(99-digit number)
13365913248273219698…97034187161610528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.673 × 10⁹⁸(99-digit number)
26731826496546439397…94068374323221056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.346 × 10⁹⁸(99-digit number)
53463652993092878794…88136748646442112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.069 × 10⁹⁹(100-digit number)
10692730598618575758…76273497292884224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.138 × 10⁹⁹(100-digit number)
21385461197237151517…52546994585768448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.277 × 10⁹⁹(100-digit number)
42770922394474303035…05093989171536896001
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,728,270 XPM·at block #6,810,522 · 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