Block #3,081,357

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/6/2019, 6:07:25 PM · Difficulty 11.0211 · 3,757,688 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1d2c4e9fd9d0f4c5590a3c172a0398d85aef20e0999665739244bf9e90e2d09e

Height

#3,081,357

Difficulty

11.021115

Transactions

3

Size

1.59 KB

Version

2

Bits

0b0567c4

Nonce

876,227,418

Timestamp

3/6/2019, 6:07:25 PM

Confirmations

3,757,688

Merkle Root

64b5f6d0e9eefb2f958ed909ae20670192d489b7dbbcc55b9837cc5196307a82
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.

5.668 × 10⁹¹(92-digit number)
56688913290981381892…78000162718612100469
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
5.668 × 10⁹¹(92-digit number)
56688913290981381892…78000162718612100469
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.133 × 10⁹²(93-digit number)
11337782658196276378…56000325437224200939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.267 × 10⁹²(93-digit number)
22675565316392552756…12000650874448401879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.535 × 10⁹²(93-digit number)
45351130632785105513…24001301748896803759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.070 × 10⁹²(93-digit number)
90702261265570211027…48002603497793607519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.814 × 10⁹³(94-digit number)
18140452253114042205…96005206995587215039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.628 × 10⁹³(94-digit number)
36280904506228084411…92010413991174430079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.256 × 10⁹³(94-digit number)
72561809012456168822…84020827982348860159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.451 × 10⁹⁴(95-digit number)
14512361802491233764…68041655964697720319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.902 × 10⁹⁴(95-digit number)
29024723604982467528…36083311929395440639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.804 × 10⁹⁴(95-digit number)
58049447209964935057…72166623858790881279
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,956,629 XPM·at block #6,839,044 · 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