Block #1,852,624

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/17/2016, 5:29:53 AM · Difficulty 10.6314 · 4,964,073 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee5e213a2096e95ece1eae7c65474b3479ee340b9b1c4f136b6fcf96fc323732

Height

#1,852,624

Difficulty

10.631371

Transactions

2

Size

869 B

Version

2

Bits

0aa1a18b

Nonce

1,231,163,259

Timestamp

11/17/2016, 5:29:53 AM

Confirmations

4,964,073

Merkle Root

3901b93656dd56c06d36bda653deeff01f9485dcb652302b9fc38bcfa179741c
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.

5.413 × 10⁹¹(92-digit number)
54135090526616264615…47897951713245408669
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.413 × 10⁹¹(92-digit number)
54135090526616264615…47897951713245408669
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.082 × 10⁹²(93-digit number)
10827018105323252923…95795903426490817339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.165 × 10⁹²(93-digit number)
21654036210646505846…91591806852981634679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.330 × 10⁹²(93-digit number)
43308072421293011692…83183613705963269359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.661 × 10⁹²(93-digit number)
86616144842586023385…66367227411926538719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.732 × 10⁹³(94-digit number)
17323228968517204677…32734454823853077439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.464 × 10⁹³(94-digit number)
34646457937034409354…65468909647706154879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.929 × 10⁹³(94-digit number)
69292915874068818708…30937819295412309759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.385 × 10⁹⁴(95-digit number)
13858583174813763741…61875638590824619519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.771 × 10⁹⁴(95-digit number)
27717166349627527483…23751277181649239039
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,777,698 XPM·at block #6,816,696 · 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