Block #3,048,722

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/11/2019, 6:38:10 PM · Difficulty 10.9961 · 3,785,172 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
34b75ced2c775114137336e54657b0489b958ce058cd3ffa54fd3c3ccb694f8d

Height

#3,048,722

Difficulty

10.996094

Transactions

9

Size

1.90 KB

Version

2

Bits

0aff0000

Nonce

1,245,835,024

Timestamp

2/11/2019, 6:38:10 PM

Confirmations

3,785,172

Merkle Root

5eb5231b3635ea1de92f19c40e26d268c0d7a88498d30215563e772c26518c06
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.243 × 10⁹⁵(96-digit number)
32439955335840432642…80199470300181968239
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.243 × 10⁹⁵(96-digit number)
32439955335840432642…80199470300181968239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.487 × 10⁹⁵(96-digit number)
64879910671680865285…60398940600363936479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.297 × 10⁹⁶(97-digit number)
12975982134336173057…20797881200727872959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.595 × 10⁹⁶(97-digit number)
25951964268672346114…41595762401455745919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.190 × 10⁹⁶(97-digit number)
51903928537344692228…83191524802911491839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.038 × 10⁹⁷(98-digit number)
10380785707468938445…66383049605822983679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.076 × 10⁹⁷(98-digit number)
20761571414937876891…32766099211645967359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.152 × 10⁹⁷(98-digit number)
41523142829875753782…65532198423291934719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.304 × 10⁹⁷(98-digit number)
83046285659751507565…31064396846583869439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.660 × 10⁹⁸(99-digit number)
16609257131950301513…62128793693167738879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.321 × 10⁹⁸(99-digit number)
33218514263900603026…24257587386335477759
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,915,376 XPM·at block #6,833,893 · 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