Block #1,541,256

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2016, 5:41:09 PM · Difficulty 10.6436 · 5,272,871 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ef07dfe6d5bef12bb1026c0f27aba3b6ad2ed9c83345cee3c70e1afd5771574

Height

#1,541,256

Difficulty

10.643590

Transactions

3

Size

3.66 KB

Version

2

Bits

0aa4c253

Nonce

322,499,395

Timestamp

4/14/2016, 5:41:09 PM

Confirmations

5,272,871

Merkle Root

a1b40c3668869f85a896595e6a9906d027ca87b75b246e158547f6f7eebe0b4b
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.

3.241 × 10⁹⁴(95-digit number)
32418202212831841553…16903392306504764761
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
3.241 × 10⁹⁴(95-digit number)
32418202212831841553…16903392306504764761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.483 × 10⁹⁴(95-digit number)
64836404425663683107…33806784613009529521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.296 × 10⁹⁵(96-digit number)
12967280885132736621…67613569226019059041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.593 × 10⁹⁵(96-digit number)
25934561770265473242…35227138452038118081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.186 × 10⁹⁵(96-digit number)
51869123540530946485…70454276904076236161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.037 × 10⁹⁶(97-digit number)
10373824708106189297…40908553808152472321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.074 × 10⁹⁶(97-digit number)
20747649416212378594…81817107616304944641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.149 × 10⁹⁶(97-digit number)
41495298832424757188…63634215232609889281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.299 × 10⁹⁶(97-digit number)
82990597664849514377…27268430465219778561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.659 × 10⁹⁷(98-digit number)
16598119532969902875…54536860930439557121
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,757,101 XPM·at block #6,814,126 · 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