Block #2,861,928

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/1/2018, 1:12:34 AM · Difficulty 11.6718 · 3,979,096 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ece61ac30649031141be3da4d5de9294a88e01a0f515ac8167be4537166cb18

Height

#2,861,928

Difficulty

11.671832

Transactions

4

Size

1.98 KB

Version

2

Bits

0babfd28

Nonce

1,006,451,269

Timestamp

10/1/2018, 1:12:34 AM

Confirmations

3,979,096

Merkle Root

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

6.194 × 10⁹⁴(95-digit number)
61943751332471384793…55510688861431050239
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
6.194 × 10⁹⁴(95-digit number)
61943751332471384793…55510688861431050239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.238 × 10⁹⁵(96-digit number)
12388750266494276958…11021377722862100479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.477 × 10⁹⁵(96-digit number)
24777500532988553917…22042755445724200959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.955 × 10⁹⁵(96-digit number)
49555001065977107834…44085510891448401919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.911 × 10⁹⁵(96-digit number)
99110002131954215669…88171021782896803839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.982 × 10⁹⁶(97-digit number)
19822000426390843133…76342043565793607679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.964 × 10⁹⁶(97-digit number)
39644000852781686267…52684087131587215359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.928 × 10⁹⁶(97-digit number)
79288001705563372535…05368174263174430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.585 × 10⁹⁷(98-digit number)
15857600341112674507…10736348526348861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.171 × 10⁹⁷(98-digit number)
31715200682225349014…21472697052697722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.343 × 10⁹⁷(98-digit number)
63430401364450698028…42945394105395445759
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,972,549 XPM·at block #6,841,023 · 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