Block #3,066,579

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/24/2019, 10:40:43 AM · Difficulty 10.9961 · 3,773,095 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dae47f3c00c8077a167acb0807e4eb4f7ff0f01bc1c55daaa086d243f8d81f8f

Height

#3,066,579

Difficulty

10.996059

Transactions

3

Size

1.90 KB

Version

2

Bits

0afefdc1

Nonce

1,896,657,210

Timestamp

2/24/2019, 10:40:43 AM

Confirmations

3,773,095

Merkle Root

03ea54aef7d5f675cbc9db074aa5791c9ef7dd87f553d958c06618250207c61b
Transactions (3)
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.

1.839 × 10⁹⁵(96-digit number)
18399703335634554075…19594196175421492799
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
1.839 × 10⁹⁵(96-digit number)
18399703335634554075…19594196175421492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.679 × 10⁹⁵(96-digit number)
36799406671269108150…39188392350842985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.359 × 10⁹⁵(96-digit number)
73598813342538216301…78376784701685971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.471 × 10⁹⁶(97-digit number)
14719762668507643260…56753569403371942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.943 × 10⁹⁶(97-digit number)
29439525337015286520…13507138806743884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.887 × 10⁹⁶(97-digit number)
58879050674030573041…27014277613487769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.177 × 10⁹⁷(98-digit number)
11775810134806114608…54028555226975539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.355 × 10⁹⁷(98-digit number)
23551620269612229216…08057110453951078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.710 × 10⁹⁷(98-digit number)
47103240539224458433…16114220907902156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.420 × 10⁹⁷(98-digit number)
94206481078448916866…32228441815804313599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.884 × 10⁹⁸(99-digit number)
18841296215689783373…64456883631608627199
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,961,681 XPM·at block #6,839,673 · 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