Block #3,049,653

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2019, 10:47:10 AM · Difficulty 11.0004 · 3,789,024 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f391a5dccdb445127d56638a094cbc732e3b8a41a4d20454f537e0fd78be69fe

Height

#3,049,653

Difficulty

11.000397

Transactions

2

Size

724 B

Version

2

Bits

0b001a02

Nonce

635,158,173

Timestamp

2/12/2019, 10:47:10 AM

Confirmations

3,789,024

Merkle Root

1b8a6c82de14d240c2a3d751d26bdd1f132e30189dbd866c70ed69f93e847f03
Transactions (2)
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.312 × 10⁹⁵(96-digit number)
33126705621602046090…33648666208829766399
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.312 × 10⁹⁵(96-digit number)
33126705621602046090…33648666208829766399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.625 × 10⁹⁵(96-digit number)
66253411243204092181…67297332417659532799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.325 × 10⁹⁶(97-digit number)
13250682248640818436…34594664835319065599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.650 × 10⁹⁶(97-digit number)
26501364497281636872…69189329670638131199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.300 × 10⁹⁶(97-digit number)
53002728994563273745…38378659341276262399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.060 × 10⁹⁷(98-digit number)
10600545798912654749…76757318682552524799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.120 × 10⁹⁷(98-digit number)
21201091597825309498…53514637365105049599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.240 × 10⁹⁷(98-digit number)
42402183195650618996…07029274730210099199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.480 × 10⁹⁷(98-digit number)
84804366391301237992…14058549460420198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.696 × 10⁹⁸(99-digit number)
16960873278260247598…28117098920840396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.392 × 10⁹⁸(99-digit number)
33921746556520495197…56234197841680793599
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,953,677 XPM·at block #6,838,676 · 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