Block #2,997,851

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2019, 9:14:17 AM · Difficulty 11.2469 · 3,847,527 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c1fb29ef5ac0e7e626be96dd6b6ac1d2f188a8ebb2a90cfb12f9298d0a83ed82

Height

#2,997,851

Difficulty

11.246887

Transactions

15

Size

3.15 KB

Version

2

Bits

0b3f33ff

Nonce

814,074,416

Timestamp

1/6/2019, 9:14:17 AM

Confirmations

3,847,527

Merkle Root

b288197e4fdde51232f39b342f7bc7630590ced2f27024019d38aae9cf5e50db
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.730 × 10⁹⁶(97-digit number)
17304769427330597900…52077961547067269119
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.730 × 10⁹⁶(97-digit number)
17304769427330597900…52077961547067269119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.460 × 10⁹⁶(97-digit number)
34609538854661195801…04155923094134538239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.921 × 10⁹⁶(97-digit number)
69219077709322391602…08311846188269076479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.384 × 10⁹⁷(98-digit number)
13843815541864478320…16623692376538152959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.768 × 10⁹⁷(98-digit number)
27687631083728956641…33247384753076305919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.537 × 10⁹⁷(98-digit number)
55375262167457913282…66494769506152611839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.107 × 10⁹⁸(99-digit number)
11075052433491582656…32989539012305223679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.215 × 10⁹⁸(99-digit number)
22150104866983165312…65979078024610447359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.430 × 10⁹⁸(99-digit number)
44300209733966330625…31958156049220894719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.860 × 10⁹⁸(99-digit number)
88600419467932661251…63916312098441789439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.772 × 10⁹⁹(100-digit number)
17720083893586532250…27832624196883578879
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:58,007,469 XPM·at block #6,845,377 · 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