Block #2,682,007

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2018, 8:00:37 PM · Difficulty 11.6906 · 4,158,995 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec536e8f452092e65ebdf4fb75e12f75c94c9538b530228206a8f58f84af1785

Height

#2,682,007

Difficulty

11.690559

Transactions

4

Size

1.91 KB

Version

2

Bits

0bb0c87a

Nonce

852,548,012

Timestamp

5/28/2018, 8:00:37 PM

Confirmations

4,158,995

Merkle Root

3c6b9b78d6fd70364d0a514933959eaf64e1cd6af038ce974df47cbc4ac2cf47
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.

6.845 × 10⁹⁶(97-digit number)
68451061767659375401…39760151114029987839
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
6.845 × 10⁹⁶(97-digit number)
68451061767659375401…39760151114029987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.369 × 10⁹⁷(98-digit number)
13690212353531875080…79520302228059975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.738 × 10⁹⁷(98-digit number)
27380424707063750160…59040604456119951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.476 × 10⁹⁷(98-digit number)
54760849414127500321…18081208912239902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.095 × 10⁹⁸(99-digit number)
10952169882825500064…36162417824479805439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.190 × 10⁹⁸(99-digit number)
21904339765651000128…72324835648959610879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.380 × 10⁹⁸(99-digit number)
43808679531302000256…44649671297919221759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.761 × 10⁹⁸(99-digit number)
87617359062604000513…89299342595838443519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.752 × 10⁹⁹(100-digit number)
17523471812520800102…78598685191676887039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.504 × 10⁹⁹(100-digit number)
35046943625041600205…57197370383353774079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.009 × 10⁹⁹(100-digit number)
70093887250083200411…14394740766707548159
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,972,370 XPM·at block #6,841,001 · 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