Block #2,641,851

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 12:26:19 PM · Difficulty 11.6340 · 4,188,777 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cad566a88464d9bc0ccb74d7b411ceb91ce925e62fccb07d2746d50e49742317

Height

#2,641,851

Difficulty

11.633998

Transactions

4

Size

878 B

Version

2

Bits

0ba24db8

Nonce

30,147,727

Timestamp

5/1/2018, 12:26:19 PM

Confirmations

4,188,777

Merkle Root

9255a3b299037e72b37d864d6173ae978289b1feda323729eca51254af13ad2c
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.864 × 10⁹⁷(98-digit number)
18647846424571986446…14695985429902499839
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.864 × 10⁹⁷(98-digit number)
18647846424571986446…14695985429902499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.729 × 10⁹⁷(98-digit number)
37295692849143972892…29391970859804999679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.459 × 10⁹⁷(98-digit number)
74591385698287945785…58783941719609999359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.491 × 10⁹⁸(99-digit number)
14918277139657589157…17567883439219998719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.983 × 10⁹⁸(99-digit number)
29836554279315178314…35135766878439997439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.967 × 10⁹⁸(99-digit number)
59673108558630356628…70271533756879994879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.193 × 10⁹⁹(100-digit number)
11934621711726071325…40543067513759989759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.386 × 10⁹⁹(100-digit number)
23869243423452142651…81086135027519979519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.773 × 10⁹⁹(100-digit number)
47738486846904285302…62172270055039959039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.547 × 10⁹⁹(100-digit number)
95476973693808570605…24344540110079918079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.909 × 10¹⁰⁰(101-digit number)
19095394738761714121…48689080220159836159
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,889,146 XPM·at block #6,830,627 · 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