Block #2,667,293

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/18/2018, 8:02:23 PM · Difficulty 11.6700 · 4,175,005 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f33a90af70d4fd133294b96c0cb7bd9043c07192c41a1de6cd8c2041d21cb8a

Height

#2,667,293

Difficulty

11.669976

Transactions

2

Size

1.86 KB

Version

2

Bits

0bab8390

Nonce

503,302,433

Timestamp

5/18/2018, 8:02:23 PM

Confirmations

4,175,005

Merkle Root

9fdd323b9227e74acb85b44062b4b2dfbf44c1304e75561c33817446277f16bf
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.

1.772 × 10⁹⁵(96-digit number)
17728820677277342421…93043516989847768319
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
1.772 × 10⁹⁵(96-digit number)
17728820677277342421…93043516989847768319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.545 × 10⁹⁵(96-digit number)
35457641354554684843…86087033979695536639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.091 × 10⁹⁵(96-digit number)
70915282709109369687…72174067959391073279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.418 × 10⁹⁶(97-digit number)
14183056541821873937…44348135918782146559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.836 × 10⁹⁶(97-digit number)
28366113083643747875…88696271837564293119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.673 × 10⁹⁶(97-digit number)
56732226167287495750…77392543675128586239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.134 × 10⁹⁷(98-digit number)
11346445233457499150…54785087350257172479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.269 × 10⁹⁷(98-digit number)
22692890466914998300…09570174700514344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.538 × 10⁹⁷(98-digit number)
45385780933829996600…19140349401028689919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.077 × 10⁹⁷(98-digit number)
90771561867659993200…38280698802057379839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.815 × 10⁹⁸(99-digit number)
18154312373531998640…76561397604114759679
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,982,788 XPM·at block #6,842,297 · 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