Block #2,946,166

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2018, 4:55:17 PM · Difficulty 11.3966 · 3,891,614 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c0cc8f1285296a703f2b51c8451d526743f35249830deda510ea3135f15ef9ee

Height

#2,946,166

Difficulty

11.396643

Transactions

28

Size

9.33 KB

Version

2

Bits

0b658a67

Nonce

30,579,628

Timestamp

11/30/2018, 4:55:17 PM

Confirmations

3,891,614

Merkle Root

67e3090400840118937f5f945094bbffc97f3c430d828037c781a365a49d9b48
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.

4.083 × 10⁹⁵(96-digit number)
40835998467681198173…30184010231193002239
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
4.083 × 10⁹⁵(96-digit number)
40835998467681198173…30184010231193002239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.167 × 10⁹⁵(96-digit number)
81671996935362396347…60368020462386004479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.633 × 10⁹⁶(97-digit number)
16334399387072479269…20736040924772008959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.266 × 10⁹⁶(97-digit number)
32668798774144958538…41472081849544017919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.533 × 10⁹⁶(97-digit number)
65337597548289917077…82944163699088035839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.306 × 10⁹⁷(98-digit number)
13067519509657983415…65888327398176071679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.613 × 10⁹⁷(98-digit number)
26135039019315966831…31776654796352143359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.227 × 10⁹⁷(98-digit number)
52270078038631933662…63553309592704286719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.045 × 10⁹⁸(99-digit number)
10454015607726386732…27106619185408573439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.090 × 10⁹⁸(99-digit number)
20908031215452773464…54213238370817146879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.181 × 10⁹⁸(99-digit number)
41816062430905546929…08426476741634293759
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,946,576 XPM·at block #6,837,779 · 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