Block #2,584,090

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2018, 3:35:54 AM · Difficulty 11.1960 · 4,259,064 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
50421a35ef9a0052ef1e45cadd27d809ed2dd946964dc09898d041b41d062a57

Height

#2,584,090

Difficulty

11.195958

Transactions

6

Size

1.89 KB

Version

2

Bits

0b322a4d

Nonce

885,215,413

Timestamp

3/25/2018, 3:35:54 AM

Confirmations

4,259,064

Merkle Root

2870b48e61360f2be84252723560f54a8f71bca531d5a5feb2188dabde76ef7f
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.528 × 10⁹⁵(96-digit number)
65284933739336559602…55829315380399948799
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.528 × 10⁹⁵(96-digit number)
65284933739336559602…55829315380399948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.305 × 10⁹⁶(97-digit number)
13056986747867311920…11658630760799897599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.611 × 10⁹⁶(97-digit number)
26113973495734623840…23317261521599795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.222 × 10⁹⁶(97-digit number)
52227946991469247681…46634523043199590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.044 × 10⁹⁷(98-digit number)
10445589398293849536…93269046086399180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.089 × 10⁹⁷(98-digit number)
20891178796587699072…86538092172798361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.178 × 10⁹⁷(98-digit number)
41782357593175398145…73076184345596723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.356 × 10⁹⁷(98-digit number)
83564715186350796290…46152368691193446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.671 × 10⁹⁸(99-digit number)
16712943037270159258…92304737382386892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.342 × 10⁹⁸(99-digit number)
33425886074540318516…84609474764773785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.685 × 10⁹⁸(99-digit number)
66851772149080637032…69218949529547571199
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,989,598 XPM·at block #6,843,153 · 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