Block #2,633,476

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 11:16:24 AM · Difficulty 11.1928 · 4,197,330 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
edf91a4b9d5a124649986ea87c0a2a69866396c3bda55b7958d1b68cac7b7ff0

Height

#2,633,476

Difficulty

11.192802

Transactions

4

Size

1.95 KB

Version

2

Bits

0b315b7c

Nonce

171,978,612

Timestamp

4/28/2018, 11:16:24 AM

Confirmations

4,197,330

Merkle Root

90405e920c1514df011bb1772f7d61b5150094fa81704fde16d5741c48cebb59
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.

6.508 × 10⁹⁵(96-digit number)
65082764177205001990…17339847803026039679
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
6.508 × 10⁹⁵(96-digit number)
65082764177205001990…17339847803026039679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.301 × 10⁹⁶(97-digit number)
13016552835441000398…34679695606052079359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.603 × 10⁹⁶(97-digit number)
26033105670882000796…69359391212104158719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.206 × 10⁹⁶(97-digit number)
52066211341764001592…38718782424208317439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.041 × 10⁹⁷(98-digit number)
10413242268352800318…77437564848416634879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.082 × 10⁹⁷(98-digit number)
20826484536705600636…54875129696833269759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.165 × 10⁹⁷(98-digit number)
41652969073411201273…09750259393666539519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.330 × 10⁹⁷(98-digit number)
83305938146822402547…19500518787333079039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.666 × 10⁹⁸(99-digit number)
16661187629364480509…39001037574666158079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.332 × 10⁹⁸(99-digit number)
33322375258728961019…78002075149332316159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.664 × 10⁹⁸(99-digit number)
66644750517457922038…56004150298664632319
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,890,579 XPM·at block #6,830,805 · 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