Block #2,545,052

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/2/2018, 6:22:10 AM · Difficulty 10.9878 · 4,297,792 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9eefe13e2ca45ea2f2a9adf7ca0a7ab458976dfe1da90c6407484b59cc88987b

Height

#2,545,052

Difficulty

10.987814

Transactions

67

Size

18.75 KB

Version

2

Bits

0afce163

Nonce

318,504,029

Timestamp

3/2/2018, 6:22:10 AM

Confirmations

4,297,792

Merkle Root

85a60ff5c2ff1f7a80339ae41ebc151606075909c1e53976b7456d447a0ffa7d
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.

2.646 × 10⁹⁶(97-digit number)
26469931545560765431…23711723548924332799
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
2.646 × 10⁹⁶(97-digit number)
26469931545560765431…23711723548924332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.293 × 10⁹⁶(97-digit number)
52939863091121530862…47423447097848665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.058 × 10⁹⁷(98-digit number)
10587972618224306172…94846894195697331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.117 × 10⁹⁷(98-digit number)
21175945236448612345…89693788391394662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.235 × 10⁹⁷(98-digit number)
42351890472897224690…79387576782789324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.470 × 10⁹⁷(98-digit number)
84703780945794449380…58775153565578649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.694 × 10⁹⁸(99-digit number)
16940756189158889876…17550307131157299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.388 × 10⁹⁸(99-digit number)
33881512378317779752…35100614262314598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.776 × 10⁹⁸(99-digit number)
67763024756635559504…70201228524629196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.355 × 10⁹⁹(100-digit number)
13552604951327111900…40402457049258393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.710 × 10⁹⁹(100-digit number)
27105209902654223801…80804914098516787199
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,987,097 XPM·at block #6,842,843 · 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