Block #3,356,982

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/16/2019, 7:38:52 AM · Difficulty 10.9960 · 3,469,910 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a6c58df6ac860b9081c205a430a314ed3d24061dabe1f5d8112ba44f1d76b6ab

Height

#3,356,982

Difficulty

10.995986

Transactions

2

Size

425 B

Version

2

Bits

0afef8e8

Nonce

1,303,853,979

Timestamp

9/16/2019, 7:38:52 AM

Confirmations

3,469,910

Merkle Root

ab1f40d1596c545d696d8c1aa9addb632e0f2c520d2307870540d60a38cadc4d
Transactions (2)
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.236 × 10⁹⁵(96-digit number)
62368562225979244804…00942605978045061119
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.236 × 10⁹⁵(96-digit number)
62368562225979244804…00942605978045061119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.247 × 10⁹⁶(97-digit number)
12473712445195848960…01885211956090122239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.494 × 10⁹⁶(97-digit number)
24947424890391697921…03770423912180244479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.989 × 10⁹⁶(97-digit number)
49894849780783395843…07540847824360488959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.978 × 10⁹⁶(97-digit number)
99789699561566791686…15081695648720977919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.995 × 10⁹⁷(98-digit number)
19957939912313358337…30163391297441955839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.991 × 10⁹⁷(98-digit number)
39915879824626716674…60326782594883911679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.983 × 10⁹⁷(98-digit number)
79831759649253433349…20653565189767823359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.596 × 10⁹⁸(99-digit number)
15966351929850686669…41307130379535646719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.193 × 10⁹⁸(99-digit number)
31932703859701373339…82614260759071293439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.386 × 10⁹⁸(99-digit number)
63865407719402746679…65228521518142586879
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,859,302 XPM·at block #6,826,891 · 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