Block #2,643,591

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 4:07:36 AM · Difficulty 11.6877 · 4,187,701 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2af8329e5bde46ca268284ddc074b01606a786b8f6d82e1dc1fc2ca6b825096d

Height

#2,643,591

Difficulty

11.687713

Transactions

10

Size

2.16 KB

Version

2

Bits

0bb00df8

Nonce

71,469,318

Timestamp

5/2/2018, 4:07:36 AM

Confirmations

4,187,701

Merkle Root

11d4d9c0cca7f6928f0bb443123d9bedcd9fa3358f19e4733f272dc2fa3f1ddf
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.

9.755 × 10⁹⁵(96-digit number)
97556062338475120125…84339531539559649919
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
9.755 × 10⁹⁵(96-digit number)
97556062338475120125…84339531539559649919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.951 × 10⁹⁶(97-digit number)
19511212467695024025…68679063079119299839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.902 × 10⁹⁶(97-digit number)
39022424935390048050…37358126158238599679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.804 × 10⁹⁶(97-digit number)
78044849870780096100…74716252316477199359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.560 × 10⁹⁷(98-digit number)
15608969974156019220…49432504632954398719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.121 × 10⁹⁷(98-digit number)
31217939948312038440…98865009265908797439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.243 × 10⁹⁷(98-digit number)
62435879896624076880…97730018531817594879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.248 × 10⁹⁸(99-digit number)
12487175979324815376…95460037063635189759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.497 × 10⁹⁸(99-digit number)
24974351958649630752…90920074127270379519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.994 × 10⁹⁸(99-digit number)
49948703917299261504…81840148254540759039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.989 × 10⁹⁸(99-digit number)
99897407834598523008…63680296509081518079
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,894,482 XPM·at block #6,831,291 · 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