Block #2,651,709

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2018, 1:05:23 AM · Difficulty 11.7495 · 4,179,338 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7d6b1acbaa66d23d7be403596a684ec58d788441a7f994bc5bb4597a48765135

Height

#2,651,709

Difficulty

11.749514

Transactions

5

Size

2.02 KB

Version

2

Bits

0bbfe022

Nonce

1,098,577,660

Timestamp

5/7/2018, 1:05:23 AM

Confirmations

4,179,338

Merkle Root

93e962bbd71ae55867208bd659efeb58fe7da2ca28680cf57b49f13c3cf87961
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.774 × 10⁹⁶(97-digit number)
27742546260962102707…90798158987834815999
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.774 × 10⁹⁶(97-digit number)
27742546260962102707…90798158987834815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.548 × 10⁹⁶(97-digit number)
55485092521924205415…81596317975669631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.109 × 10⁹⁷(98-digit number)
11097018504384841083…63192635951339263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.219 × 10⁹⁷(98-digit number)
22194037008769682166…26385271902678527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.438 × 10⁹⁷(98-digit number)
44388074017539364332…52770543805357055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.877 × 10⁹⁷(98-digit number)
88776148035078728664…05541087610714111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.775 × 10⁹⁸(99-digit number)
17755229607015745732…11082175221428223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.551 × 10⁹⁸(99-digit number)
35510459214031491465…22164350442856447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.102 × 10⁹⁸(99-digit number)
71020918428062982931…44328700885712895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.420 × 10⁹⁹(100-digit number)
14204183685612596586…88657401771425791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.840 × 10⁹⁹(100-digit number)
28408367371225193172…77314803542851583999
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,892,512 XPM·at block #6,831,046 · 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