Block #1,005,431

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/7/2015, 3:51:15 AM · Difficulty 10.7386 · 5,804,060 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
40e4ca4098edb16d2737dff9e612b1a4f0935c9efce28691c291ba625ea3a310

Height

#1,005,431

Difficulty

10.738632

Transactions

4

Size

4.69 KB

Version

2

Bits

0abd1702

Nonce

504,366,082

Timestamp

4/7/2015, 3:51:15 AM

Confirmations

5,804,060

Merkle Root

76cae23faacf2915d885f89d5b8056015438a4b9947762000ce14dde6aa22348
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.

5.261 × 10⁹⁵(96-digit number)
52613729253562618047…20255268538480224321
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
5.261 × 10⁹⁵(96-digit number)
52613729253562618047…20255268538480224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.052 × 10⁹⁶(97-digit number)
10522745850712523609…40510537076960448641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.104 × 10⁹⁶(97-digit number)
21045491701425047219…81021074153920897281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.209 × 10⁹⁶(97-digit number)
42090983402850094438…62042148307841794561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.418 × 10⁹⁶(97-digit number)
84181966805700188876…24084296615683589121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.683 × 10⁹⁷(98-digit number)
16836393361140037775…48168593231367178241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.367 × 10⁹⁷(98-digit number)
33672786722280075550…96337186462734356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.734 × 10⁹⁷(98-digit number)
67345573444560151100…92674372925468712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.346 × 10⁹⁸(99-digit number)
13469114688912030220…85348745850937425921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.693 × 10⁹⁸(99-digit number)
26938229377824060440…70697491701874851841
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,720,000 XPM·at block #6,809,490 · 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