Block #2,691,728

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/4/2018, 4:26:49 PM · Difficulty 11.6818 · 4,147,624 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7500d7bf34f33562ab951fe394dbb9a093005e827126eef3d8f112618f10ef07

Height

#2,691,728

Difficulty

11.681828

Transactions

3

Size

1.04 KB

Version

2

Bits

0bae8c45

Nonce

439,880,689

Timestamp

6/4/2018, 4:26:49 PM

Confirmations

4,147,624

Merkle Root

0f5796f858f97f17466926ae24f4867b2aeb6de0adbf55ee937803ecb36dc46d
Transactions (3)
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.

7.727 × 10⁹⁶(97-digit number)
77270651724741588288…88115009996161369599
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
7.727 × 10⁹⁶(97-digit number)
77270651724741588288…88115009996161369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.545 × 10⁹⁷(98-digit number)
15454130344948317657…76230019992322739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.090 × 10⁹⁷(98-digit number)
30908260689896635315…52460039984645478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.181 × 10⁹⁷(98-digit number)
61816521379793270630…04920079969290956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.236 × 10⁹⁸(99-digit number)
12363304275958654126…09840159938581913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.472 × 10⁹⁸(99-digit number)
24726608551917308252…19680319877163827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.945 × 10⁹⁸(99-digit number)
49453217103834616504…39360639754327654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.890 × 10⁹⁸(99-digit number)
98906434207669233009…78721279508655308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.978 × 10⁹⁹(100-digit number)
19781286841533846601…57442559017310617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.956 × 10⁹⁹(100-digit number)
39562573683067693203…14885118034621235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.912 × 10⁹⁹(100-digit number)
79125147366135386407…29770236069242470399
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,959,102 XPM·at block #6,839,351 · 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