Block #3,330,686

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/28/2019, 12:20:40 PM · Difficulty 11.0062 · 3,511,323 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
248d7554bf8e09346f18718889298a385d95ae9bd9e509d1332fc03ba0fc48e7

Height

#3,330,686

Difficulty

11.006165

Transactions

2

Size

574 B

Version

2

Bits

0b019403

Nonce

107,181,025

Timestamp

8/28/2019, 12:20:40 PM

Confirmations

3,511,323

Merkle Root

d1b897765090cdd70e56ec8ba83823eab9882f69affa8d7d37abcf5a46f9d984
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.

3.719 × 10⁹⁵(96-digit number)
37192082465098740834…94847615397834717759
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.719 × 10⁹⁵(96-digit number)
37192082465098740834…94847615397834717759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.438 × 10⁹⁵(96-digit number)
74384164930197481669…89695230795669435519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.487 × 10⁹⁶(97-digit number)
14876832986039496333…79390461591338871039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.975 × 10⁹⁶(97-digit number)
29753665972078992667…58780923182677742079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.950 × 10⁹⁶(97-digit number)
59507331944157985335…17561846365355484159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.190 × 10⁹⁷(98-digit number)
11901466388831597067…35123692730710968319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.380 × 10⁹⁷(98-digit number)
23802932777663194134…70247385461421936639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.760 × 10⁹⁷(98-digit number)
47605865555326388268…40494770922843873279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.521 × 10⁹⁷(98-digit number)
95211731110652776537…80989541845687746559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.904 × 10⁹⁸(99-digit number)
19042346222130555307…61979083691375493119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.808 × 10⁹⁸(99-digit number)
38084692444261110614…23958167382750986239
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,980,457 XPM·at block #6,842,008 · 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