Block #2,870,660

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/7/2018, 4:21:37 AM · Difficulty 11.6658 · 3,970,668 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0aa82074801b668c92263eb156ffc669e192ceb6019cb357df3b7acbc2a978e0

Height

#2,870,660

Difficulty

11.665824

Transactions

3

Size

1.00 KB

Version

2

Bits

0baa736a

Nonce

1,104,299,865

Timestamp

10/7/2018, 4:21:37 AM

Confirmations

3,970,668

Merkle Root

caedd269a130851b77b5ff19259b5fb673fe05c502a647d1ba2b297b0861d260
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.

2.008 × 10⁹⁶(97-digit number)
20086189177711930815…49772705370903301119
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
2.008 × 10⁹⁶(97-digit number)
20086189177711930815…49772705370903301119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.017 × 10⁹⁶(97-digit number)
40172378355423861631…99545410741806602239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.034 × 10⁹⁶(97-digit number)
80344756710847723263…99090821483613204479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.606 × 10⁹⁷(98-digit number)
16068951342169544652…98181642967226408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.213 × 10⁹⁷(98-digit number)
32137902684339089305…96363285934452817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.427 × 10⁹⁷(98-digit number)
64275805368678178611…92726571868905635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.285 × 10⁹⁸(99-digit number)
12855161073735635722…85453143737811271679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.571 × 10⁹⁸(99-digit number)
25710322147471271444…70906287475622543359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.142 × 10⁹⁸(99-digit number)
51420644294942542888…41812574951245086719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.028 × 10⁹⁹(100-digit number)
10284128858988508577…83625149902490173439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.056 × 10⁹⁹(100-digit number)
20568257717977017155…67250299804980346879
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,974,987 XPM·at block #6,841,327 · 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