Block #3,009,133

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2019, 10:05:46 AM · Difficulty 11.2030 · 3,833,896 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8b767558332fce9a9e2ae1dc591772229e45cb50573e5e3a79349536237737a6

Height

#3,009,133

Difficulty

11.202953

Transactions

23

Size

6.35 KB

Version

2

Bits

0b33f4c1

Nonce

1,521,959,876

Timestamp

1/14/2019, 10:05:46 AM

Confirmations

3,833,896

Merkle Root

54db61f9211999194fd60a95d584436b0dec74d6723c96eebbc13dcccb2a404f
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.754 × 10⁹⁶(97-digit number)
17548416107951656885…38735842352231928319
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.754 × 10⁹⁶(97-digit number)
17548416107951656885…38735842352231928319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.509 × 10⁹⁶(97-digit number)
35096832215903313771…77471684704463856639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.019 × 10⁹⁶(97-digit number)
70193664431806627543…54943369408927713279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.403 × 10⁹⁷(98-digit number)
14038732886361325508…09886738817855426559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.807 × 10⁹⁷(98-digit number)
28077465772722651017…19773477635710853119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.615 × 10⁹⁷(98-digit number)
56154931545445302034…39546955271421706239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.123 × 10⁹⁸(99-digit number)
11230986309089060406…79093910542843412479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.246 × 10⁹⁸(99-digit number)
22461972618178120813…58187821085686824959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.492 × 10⁹⁸(99-digit number)
44923945236356241627…16375642171373649919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.984 × 10⁹⁸(99-digit number)
89847890472712483255…32751284342747299839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.796 × 10⁹⁹(100-digit number)
17969578094542496651…65502568685494599679
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,988,586 XPM·at block #6,843,028 · 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