Block #2,638,826

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 10:25:56 AM · Difficulty 11.5106 · 4,198,487 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ad93e15849113fbcc5d4e34dc4b15bba3bc17538ed725b87ef94b769443d4ec2

Height

#2,638,826

Difficulty

11.510550

Transactions

8

Size

2.53 KB

Version

2

Bits

0b82b36a

Nonce

42,109,499

Timestamp

4/30/2018, 10:25:56 AM

Confirmations

4,198,487

Merkle Root

950f0bbb9a241a32a4d349ea96c531904a1c836a0f647e4af05fc106e83c6dc9
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.190 × 10⁹⁵(96-digit number)
11903887515548188599…22734965406168217119
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.190 × 10⁹⁵(96-digit number)
11903887515548188599…22734965406168217119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.380 × 10⁹⁵(96-digit number)
23807775031096377199…45469930812336434239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.761 × 10⁹⁵(96-digit number)
47615550062192754398…90939861624672868479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.523 × 10⁹⁵(96-digit number)
95231100124385508797…81879723249345736959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.904 × 10⁹⁶(97-digit number)
19046220024877101759…63759446498691473919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.809 × 10⁹⁶(97-digit number)
38092440049754203518…27518892997382947839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.618 × 10⁹⁶(97-digit number)
76184880099508407037…55037785994765895679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.523 × 10⁹⁷(98-digit number)
15236976019901681407…10075571989531791359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.047 × 10⁹⁷(98-digit number)
30473952039803362815…20151143979063582719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.094 × 10⁹⁷(98-digit number)
60947904079606725630…40302287958127165439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.218 × 10⁹⁸(99-digit number)
12189580815921345126…80604575916254330879
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,942,822 XPM·at block #6,837,312 · 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