Block #2,044,735

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2017, 6:22:05 AM · Difficulty 10.6788 · 4,786,560 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
80cef4dc831d87353906c0b2ad1cef79b711d27c7d39d4138d33ce5d8c16c7d0

Height

#2,044,735

Difficulty

10.678839

Transactions

2

Size

428 B

Version

2

Bits

0aadc868

Nonce

745,207,571

Timestamp

3/30/2017, 6:22:05 AM

Confirmations

4,786,560

Merkle Root

893b1e7843a1c2093dc79f908851488a80fc602efadfda60a6cb9bb367b85114
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.

2.163 × 10⁹⁷(98-digit number)
21630035200674377505…57812967594036613119
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.163 × 10⁹⁷(98-digit number)
21630035200674377505…57812967594036613119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.326 × 10⁹⁷(98-digit number)
43260070401348755011…15625935188073226239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.652 × 10⁹⁷(98-digit number)
86520140802697510022…31251870376146452479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.730 × 10⁹⁸(99-digit number)
17304028160539502004…62503740752292904959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.460 × 10⁹⁸(99-digit number)
34608056321079004008…25007481504585809919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.921 × 10⁹⁸(99-digit number)
69216112642158008017…50014963009171619839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.384 × 10⁹⁹(100-digit number)
13843222528431601603…00029926018343239679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.768 × 10⁹⁹(100-digit number)
27686445056863203207…00059852036686479359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.537 × 10⁹⁹(100-digit number)
55372890113726406414…00119704073372958719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.107 × 10¹⁰⁰(101-digit number)
11074578022745281282…00239408146745917439
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,894,507 XPM·at block #6,831,294 · 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