1. #6,808,4652CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #3,495,335

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2019, 4:19:03 PM · Difficulty 10.9466 · 3,313,131 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c9f602e28bdbbc21ef2104d63a48336754e8cd59c2c55670752a33982e44f10

Height

#3,495,335

Difficulty

10.946588

Transactions

7

Size

2.23 KB

Version

2

Bits

0af25394

Nonce

295,077,326

Timestamp

12/31/2019, 4:19:03 PM

Confirmations

3,313,131

Merkle Root

75abee2048c959f4eba17f77888c9f47c5a162f56294e4781ff653607bb1c64c
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.

9.888 × 10⁹⁴(95-digit number)
98889695944267121135…87414586990224802959
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
9.888 × 10⁹⁴(95-digit number)
98889695944267121135…87414586990224802959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.977 × 10⁹⁵(96-digit number)
19777939188853424227…74829173980449605919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.955 × 10⁹⁵(96-digit number)
39555878377706848454…49658347960899211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.911 × 10⁹⁵(96-digit number)
79111756755413696908…99316695921798423679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.582 × 10⁹⁶(97-digit number)
15822351351082739381…98633391843596847359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.164 × 10⁹⁶(97-digit number)
31644702702165478763…97266783687193694719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.328 × 10⁹⁶(97-digit number)
63289405404330957527…94533567374387389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.265 × 10⁹⁷(98-digit number)
12657881080866191505…89067134748774778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.531 × 10⁹⁷(98-digit number)
25315762161732383010…78134269497549557759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.063 × 10⁹⁷(98-digit number)
50631524323464766021…56268538995099115519
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,711,792 XPM·at block #6,808,465 · 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.

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