Block #2,787,855

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2018, 1:24:38 PM · Difficulty 11.6741 · 4,055,176 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9a75dfc9bf0eec98a437fd1af96166c2d1cac50baac56960d6673d27eb925a47

Height

#2,787,855

Difficulty

11.674051

Transactions

6

Size

2.18 KB

Version

2

Bits

0bac8e9f

Nonce

530,792,880

Timestamp

8/10/2018, 1:24:38 PM

Confirmations

4,055,176

Merkle Root

aef2b5be7e2f3847352ab73a735e61de1286f43d9ecdb13340d63d4d648e0c14
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.387 × 10⁹³(94-digit number)
53872583478546242384…32031239830857042999
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.387 × 10⁹³(94-digit number)
53872583478546242384…32031239830857042999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.077 × 10⁹⁴(95-digit number)
10774516695709248476…64062479661714085999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.154 × 10⁹⁴(95-digit number)
21549033391418496953…28124959323428171999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.309 × 10⁹⁴(95-digit number)
43098066782836993907…56249918646856343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.619 × 10⁹⁴(95-digit number)
86196133565673987815…12499837293712687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.723 × 10⁹⁵(96-digit number)
17239226713134797563…24999674587425375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.447 × 10⁹⁵(96-digit number)
34478453426269595126…49999349174850751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.895 × 10⁹⁵(96-digit number)
68956906852539190252…99998698349701503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.379 × 10⁹⁶(97-digit number)
13791381370507838050…99997396699403007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.758 × 10⁹⁶(97-digit number)
27582762741015676101…99994793398806015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.516 × 10⁹⁶(97-digit number)
55165525482031352202…99989586797612031999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,988,603 XPM·at block #6,843,030 · 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