Block #2,053,861

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2017, 6:34:21 AM · Difficulty 10.7815 · 4,771,397 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bc8565240edbb4f9542da26a8b3c70bb841f242f5dec0c1dd6e8366be4d735fc

Height

#2,053,861

Difficulty

10.781485

Transactions

2

Size

1.43 KB

Version

2

Bits

0ac80f64

Nonce

276,870,395

Timestamp

4/4/2017, 6:34:21 AM

Confirmations

4,771,397

Merkle Root

4c7dacbe24e95c06a91cda42c75ace32ebb87379c7dd8e07ff8aad6ef9c9615e
Transactions (2)
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.

1.116 × 10⁹⁵(96-digit number)
11163797347685275092…71920541299502936959
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
1.116 × 10⁹⁵(96-digit number)
11163797347685275092…71920541299502936959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.232 × 10⁹⁵(96-digit number)
22327594695370550184…43841082599005873919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.465 × 10⁹⁵(96-digit number)
44655189390741100368…87682165198011747839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.931 × 10⁹⁵(96-digit number)
89310378781482200737…75364330396023495679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.786 × 10⁹⁶(97-digit number)
17862075756296440147…50728660792046991359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.572 × 10⁹⁶(97-digit number)
35724151512592880295…01457321584093982719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.144 × 10⁹⁶(97-digit number)
71448303025185760590…02914643168187965439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.428 × 10⁹⁷(98-digit number)
14289660605037152118…05829286336375930879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.857 × 10⁹⁷(98-digit number)
28579321210074304236…11658572672751861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.715 × 10⁹⁷(98-digit number)
57158642420148608472…23317145345503723519
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,846,161 XPM·at block #6,825,257 · 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