Block #1,563,039

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2016, 7:04:34 PM · Difficulty 10.7381 · 5,264,116 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3db1a96d836f740977d1e215ef57a976ffe89e3320bdf59381bf85c66a708447

Height

#1,563,039

Difficulty

10.738055

Transactions

2

Size

1.18 KB

Version

2

Bits

0abcf124

Nonce

808,401,598

Timestamp

4/28/2016, 7:04:34 PM

Confirmations

5,264,116

Merkle Root

3b90785db5e39a2eabe7edbe6c6d80fbe01a092557b0b76bab0d41a900b4fce5
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.

7.886 × 10⁹⁵(96-digit number)
78861394456332088043…02474603878905510401
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
7.886 × 10⁹⁵(96-digit number)
78861394456332088043…02474603878905510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.577 × 10⁹⁶(97-digit number)
15772278891266417608…04949207757811020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.154 × 10⁹⁶(97-digit number)
31544557782532835217…09898415515622041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.308 × 10⁹⁶(97-digit number)
63089115565065670434…19796831031244083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.261 × 10⁹⁷(98-digit number)
12617823113013134086…39593662062488166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.523 × 10⁹⁷(98-digit number)
25235646226026268173…79187324124976332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.047 × 10⁹⁷(98-digit number)
50471292452052536347…58374648249952665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.009 × 10⁹⁸(99-digit number)
10094258490410507269…16749296499905331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.018 × 10⁹⁸(99-digit number)
20188516980821014539…33498592999810662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.037 × 10⁹⁸(99-digit number)
40377033961642029078…66997185999621324801
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,861,424 XPM·at block #6,827,154 · 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