Block #2,660,840

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/14/2018, 4:59:43 PM · Difficulty 11.6347 · 4,181,153 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6d4854773b97c9d29547c2814503b81cbd7c11f65a0e5e06b502c644ed2c95c2

Height

#2,660,840

Difficulty

11.634660

Transactions

2

Size

723 B

Version

2

Bits

0ba2790f

Nonce

1,772,977,027

Timestamp

5/14/2018, 4:59:43 PM

Confirmations

4,181,153

Merkle Root

1fa34c1c60dfd3c522ba8e01ae2d3f5ff2df060aaf94673d9721fa40732fe9d1
Transactions (2)
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.

8.687 × 10⁹⁶(97-digit number)
86870862756978355082…53130749549800652799
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
8.687 × 10⁹⁶(97-digit number)
86870862756978355082…53130749549800652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.737 × 10⁹⁷(98-digit number)
17374172551395671016…06261499099601305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.474 × 10⁹⁷(98-digit number)
34748345102791342032…12522998199202611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.949 × 10⁹⁷(98-digit number)
69496690205582684065…25045996398405222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.389 × 10⁹⁸(99-digit number)
13899338041116536813…50091992796810444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.779 × 10⁹⁸(99-digit number)
27798676082233073626…00183985593620889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.559 × 10⁹⁸(99-digit number)
55597352164466147252…00367971187241779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.111 × 10⁹⁹(100-digit number)
11119470432893229450…00735942374483558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.223 × 10⁹⁹(100-digit number)
22238940865786458901…01471884748967116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.447 × 10⁹⁹(100-digit number)
44477881731572917802…02943769497934233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.895 × 10⁹⁹(100-digit number)
88955763463145835604…05887538995868467199
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,980,331 XPM·at block #6,841,992 · 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