Block #2,165,863

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/18/2017, 11:42:54 AM · Difficulty 10.8984 · 4,659,160 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5be6519260ea6e8e53a33074317db527da33d903b4b27671c789c09d5a3db67d

Height

#2,165,863

Difficulty

10.898365

Transactions

3

Size

5.34 KB

Version

2

Bits

0ae5fb41

Nonce

83,601,012

Timestamp

6/18/2017, 11:42:54 AM

Confirmations

4,659,160

Merkle Root

a85192b27d491a07b388a5aafdc24e6cbbc70371e05850cee67ffe9bc678ce19
Transactions (3)
1 in → 1 out8.5100 XPM109 B
9 in → 1 out2182.2301 XPM1.35 KB
26 in → 1 out139.8526 XPM3.80 KB
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.563 × 10⁹¹(92-digit number)
15633716967263858515…32135404416101619999
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.563 × 10⁹¹(92-digit number)
15633716967263858515…32135404416101619999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.126 × 10⁹¹(92-digit number)
31267433934527717030…64270808832203239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.253 × 10⁹¹(92-digit number)
62534867869055434060…28541617664406479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.250 × 10⁹²(93-digit number)
12506973573811086812…57083235328812959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.501 × 10⁹²(93-digit number)
25013947147622173624…14166470657625919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.002 × 10⁹²(93-digit number)
50027894295244347248…28332941315251839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.000 × 10⁹³(94-digit number)
10005578859048869449…56665882630503679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.001 × 10⁹³(94-digit number)
20011157718097738899…13331765261007359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.002 × 10⁹³(94-digit number)
40022315436195477798…26663530522014719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.004 × 10⁹³(94-digit number)
80044630872390955596…53327061044029439999
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,844,267 XPM·at block #6,825,022 · 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