Block #2,803,308

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/21/2018, 9:14:03 AM · Difficulty 11.6659 · 4,039,953 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f3773562ad3edb6afe76f4aa426aefd294ced4acbc45b31487c54fbce85ae4f9

Height

#2,803,308

Difficulty

11.665865

Transactions

6

Size

1.46 KB

Version

2

Bits

0baa761c

Nonce

321,271,033

Timestamp

8/21/2018, 9:14:03 AM

Confirmations

4,039,953

Merkle Root

3ddf65485c7d6b278a0efdde5d378702c1df3d56d5cedb4dd0756ccb86ad43c7
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.201 × 10⁹⁴(95-digit number)
22017221484535166695…65996628586298321959
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.201 × 10⁹⁴(95-digit number)
22017221484535166695…65996628586298321959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.403 × 10⁹⁴(95-digit number)
44034442969070333390…31993257172596643919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.806 × 10⁹⁴(95-digit number)
88068885938140666780…63986514345193287839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.761 × 10⁹⁵(96-digit number)
17613777187628133356…27973028690386575679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.522 × 10⁹⁵(96-digit number)
35227554375256266712…55946057380773151359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.045 × 10⁹⁵(96-digit number)
70455108750512533424…11892114761546302719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.409 × 10⁹⁶(97-digit number)
14091021750102506684…23784229523092605439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.818 × 10⁹⁶(97-digit number)
28182043500205013369…47568459046185210879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.636 × 10⁹⁶(97-digit number)
56364087000410026739…95136918092370421759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.127 × 10⁹⁷(98-digit number)
11272817400082005347…90273836184740843519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.254 × 10⁹⁷(98-digit number)
22545634800164010695…80547672369481687039
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,990,461 XPM·at block #6,843,260 · 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