Block #3,246,295

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/29/2019, 3:39:41 PM · Difficulty 11.0095 · 3,599,069 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ad0ea07cdd45694bc03d5021ca4248d2a8eada4357cf20fe5016d1bc3d94df2f

Height

#3,246,295

Difficulty

11.009500

Transactions

6

Size

2.30 KB

Version

2

Bits

0b026e95

Nonce

64,414,277

Timestamp

6/29/2019, 3:39:41 PM

Confirmations

3,599,069

Merkle Root

498351ee22a5ca11d96295f80b16cda2c525b938fe25ce6a0c6135ce08aee991
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.

3.395 × 10⁹⁴(95-digit number)
33951775893322382829…16566578377926380199
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
3.395 × 10⁹⁴(95-digit number)
33951775893322382829…16566578377926380199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.790 × 10⁹⁴(95-digit number)
67903551786644765658…33133156755852760399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.358 × 10⁹⁵(96-digit number)
13580710357328953131…66266313511705520799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.716 × 10⁹⁵(96-digit number)
27161420714657906263…32532627023411041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.432 × 10⁹⁵(96-digit number)
54322841429315812526…65065254046822083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.086 × 10⁹⁶(97-digit number)
10864568285863162505…30130508093644166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.172 × 10⁹⁶(97-digit number)
21729136571726325010…60261016187288332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.345 × 10⁹⁶(97-digit number)
43458273143452650021…20522032374576665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.691 × 10⁹⁶(97-digit number)
86916546286905300042…41044064749153331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.738 × 10⁹⁷(98-digit number)
17383309257381060008…82088129498306662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.476 × 10⁹⁷(98-digit number)
34766618514762120017…64176258996613324799
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:58,007,356 XPM·at block #6,845,363 · 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