Block #2,637,811

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 1:37:45 AM · Difficulty 11.4608 · 4,201,940 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e944859d36416c1bc8a7cf8b3414dde2463933821b4f464b3a79757737069a5

Height

#2,637,811

Difficulty

11.460819

Transactions

3

Size

945 B

Version

2

Bits

0b75f837

Nonce

73,250,724

Timestamp

4/30/2018, 1:37:45 AM

Confirmations

4,201,940

Merkle Root

53113c254752658fe91b595ed96f3fd9ba6c2aaaca1972e6cd3cc617d972cfcd
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.

5.220 × 10⁹²(93-digit number)
52204224610093715472…80313630993132738549
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
5.220 × 10⁹²(93-digit number)
52204224610093715472…80313630993132738549
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.044 × 10⁹³(94-digit number)
10440844922018743094…60627261986265477099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.088 × 10⁹³(94-digit number)
20881689844037486188…21254523972530954199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.176 × 10⁹³(94-digit number)
41763379688074972377…42509047945061908399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.352 × 10⁹³(94-digit number)
83526759376149944755…85018095890123816799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.670 × 10⁹⁴(95-digit number)
16705351875229988951…70036191780247633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.341 × 10⁹⁴(95-digit number)
33410703750459977902…40072383560495267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.682 × 10⁹⁴(95-digit number)
66821407500919955804…80144767120990534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.336 × 10⁹⁵(96-digit number)
13364281500183991160…60289534241981068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.672 × 10⁹⁵(96-digit number)
26728563000367982321…20579068483962137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.345 × 10⁹⁵(96-digit number)
53457126000735964643…41158136967924275199
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,962,294 XPM·at block #6,839,750 · 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