Block #3,059,172

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2019, 3:37:26 AM · Difficulty 11.0094 · 3,784,167 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0146d03257886a3addf83288e3aa282f03e603493cb6c75b58bd8b5f17dcb12a

Height

#3,059,172

Difficulty

11.009427

Transactions

3

Size

652 B

Version

2

Bits

0b0269d6

Nonce

1,824,839,632

Timestamp

2/19/2019, 3:37:26 AM

Confirmations

3,784,167

Merkle Root

845d3db95f3aa0222ab9bd5da850f2054293973267101b8dd68a985c2c34b059
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.

2.724 × 10⁹⁶(97-digit number)
27243722948367627926…72328416369230729599
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
2.724 × 10⁹⁶(97-digit number)
27243722948367627926…72328416369230729599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.448 × 10⁹⁶(97-digit number)
54487445896735255852…44656832738461459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.089 × 10⁹⁷(98-digit number)
10897489179347051170…89313665476922918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.179 × 10⁹⁷(98-digit number)
21794978358694102340…78627330953845836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.358 × 10⁹⁷(98-digit number)
43589956717388204681…57254661907691673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.717 × 10⁹⁷(98-digit number)
87179913434776409363…14509323815383347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.743 × 10⁹⁸(99-digit number)
17435982686955281872…29018647630766694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.487 × 10⁹⁸(99-digit number)
34871965373910563745…58037295261533388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.974 × 10⁹⁸(99-digit number)
69743930747821127491…16074590523066777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.394 × 10⁹⁹(100-digit number)
13948786149564225498…32149181046133555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.789 × 10⁹⁹(100-digit number)
27897572299128450996…64298362092267110399
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,991,072 XPM·at block #6,843,338 · 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