Block #2,654,843

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2018, 4:26:11 PM · Difficulty 11.7139 · 4,188,053 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b30eb431359dbb68827d671cadd2052cdc2663deb57fc9efe11dad4282bf45f5

Height

#2,654,843

Difficulty

11.713928

Transactions

4

Size

1.37 KB

Version

2

Bits

0bb6c402

Nonce

2,094,050,597

Timestamp

5/9/2018, 4:26:11 PM

Confirmations

4,188,053

Merkle Root

b171e2d14edabeb80b573b239d785eeef8be073bc3dc2ca21a50a6e3c0187bfa
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.777 × 10⁹⁵(96-digit number)
27776574780428377028…26876314200891557119
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.777 × 10⁹⁵(96-digit number)
27776574780428377028…26876314200891557119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.555 × 10⁹⁵(96-digit number)
55553149560856754056…53752628401783114239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.111 × 10⁹⁶(97-digit number)
11110629912171350811…07505256803566228479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.222 × 10⁹⁶(97-digit number)
22221259824342701622…15010513607132456959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.444 × 10⁹⁶(97-digit number)
44442519648685403245…30021027214264913919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.888 × 10⁹⁶(97-digit number)
88885039297370806490…60042054428529827839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.777 × 10⁹⁷(98-digit number)
17777007859474161298…20084108857059655679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.555 × 10⁹⁷(98-digit number)
35554015718948322596…40168217714119311359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.110 × 10⁹⁷(98-digit number)
71108031437896645192…80336435428238622719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.422 × 10⁹⁸(99-digit number)
14221606287579329038…60672870856477245439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.844 × 10⁹⁸(99-digit number)
28443212575158658077…21345741712954490879
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,516 XPM·at block #6,842,895 · 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