Block #2,642,481

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 6:13:40 PM · Difficulty 11.6540 · 4,197,093 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7463cf4d7d69b97fe41b25b0064b198716f0a9e5289c2c417aa8698d37828509

Height

#2,642,481

Difficulty

11.654039

Transactions

2

Size

1.50 KB

Version

2

Bits

0ba76f12

Nonce

1,921,957,632

Timestamp

5/1/2018, 6:13:40 PM

Confirmations

4,197,093

Merkle Root

f54ee213111c1228f7ba8da6346692ef2bf7b294a590f5eab1975b6584a98794
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.033 × 10⁹⁵(96-digit number)
70334501625051718411…40908983615428217119
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.033 × 10⁹⁵(96-digit number)
70334501625051718411…40908983615428217119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.406 × 10⁹⁶(97-digit number)
14066900325010343682…81817967230856434239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.813 × 10⁹⁶(97-digit number)
28133800650020687364…63635934461712868479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.626 × 10⁹⁶(97-digit number)
56267601300041374729…27271868923425736959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.125 × 10⁹⁷(98-digit number)
11253520260008274945…54543737846851473919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.250 × 10⁹⁷(98-digit number)
22507040520016549891…09087475693702947839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.501 × 10⁹⁷(98-digit number)
45014081040033099783…18174951387405895679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.002 × 10⁹⁷(98-digit number)
90028162080066199566…36349902774811791359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.800 × 10⁹⁸(99-digit number)
18005632416013239913…72699805549623582719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.601 × 10⁹⁸(99-digit number)
36011264832026479826…45399611099247165439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.202 × 10⁹⁸(99-digit number)
72022529664052959653…90799222198494330879
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,960,878 XPM·at block #6,839,573 · 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