Block #2,865,331

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/3/2018, 10:19:20 AM · Difficulty 11.6706 · 3,977,881 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0564261a1def131eb12102dc1fb1682a88657fcbcd64aa2cf5615c0668062528

Height

#2,865,331

Difficulty

11.670640

Transactions

4

Size

1.81 KB

Version

2

Bits

0babaf09

Nonce

369,708,175

Timestamp

10/3/2018, 10:19:20 AM

Confirmations

3,977,881

Merkle Root

a1d040b809565e842a0fe14101f84734a6cd5a2336957673b63d0efee489128c
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.

2.695 × 10⁹⁵(96-digit number)
26952139214577246949…73038378929876336639
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
2.695 × 10⁹⁵(96-digit number)
26952139214577246949…73038378929876336639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.390 × 10⁹⁵(96-digit number)
53904278429154493899…46076757859752673279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.078 × 10⁹⁶(97-digit number)
10780855685830898779…92153515719505346559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.156 × 10⁹⁶(97-digit number)
21561711371661797559…84307031439010693119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.312 × 10⁹⁶(97-digit number)
43123422743323595119…68614062878021386239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.624 × 10⁹⁶(97-digit number)
86246845486647190238…37228125756042772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.724 × 10⁹⁷(98-digit number)
17249369097329438047…74456251512085544959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.449 × 10⁹⁷(98-digit number)
34498738194658876095…48912503024171089919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.899 × 10⁹⁷(98-digit number)
68997476389317752190…97825006048342179839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.379 × 10⁹⁸(99-digit number)
13799495277863550438…95650012096684359679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.759 × 10⁹⁸(99-digit number)
27598990555727100876…91300024193368719359
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,990,069 XPM·at block #6,843,211 · 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