Block #2,641,691

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 11:07:21 AM · Difficulty 11.6281 · 4,189,712 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d8804ca6f7a8da2ee42e9a4b2e57d68fe40bed96edd17c45fa047c94650e6cc3

Height

#2,641,691

Difficulty

11.628080

Transactions

2

Size

427 B

Version

2

Bits

0ba0c9dc

Nonce

176,210,509

Timestamp

5/1/2018, 11:07:21 AM

Confirmations

4,189,712

Merkle Root

b497ea77090f4cc64857aac7d3fe1ab35972aaac4bf2a3952c9bfec14dba294f
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.238 × 10⁹⁸(99-digit number)
12387149818242984344…05459632933549711359
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.238 × 10⁹⁸(99-digit number)
12387149818242984344…05459632933549711359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.477 × 10⁹⁸(99-digit number)
24774299636485968688…10919265867099422719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.954 × 10⁹⁸(99-digit number)
49548599272971937376…21838531734198845439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.909 × 10⁹⁸(99-digit number)
99097198545943874753…43677063468397690879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.981 × 10⁹⁹(100-digit number)
19819439709188774950…87354126936795381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.963 × 10⁹⁹(100-digit number)
39638879418377549901…74708253873590763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.927 × 10⁹⁹(100-digit number)
79277758836755099803…49416507747181527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.585 × 10¹⁰⁰(101-digit number)
15855551767351019960…98833015494363054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.171 × 10¹⁰⁰(101-digit number)
31711103534702039921…97666030988726108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.342 × 10¹⁰⁰(101-digit number)
63422207069404079842…95332061977452216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.268 × 10¹⁰¹(102-digit number)
12684441413880815968…90664123954904432639
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,895,381 XPM·at block #6,831,402 · 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