Block #2,044,811

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2017, 7:42:27 AM · Difficulty 10.6791 · 4,773,063 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b24f2407b239b8d621530b508ab95337d916ea118b939a71f9694eb8ac800644

Height

#2,044,811

Difficulty

10.679138

Transactions

3

Size

6.74 KB

Version

2

Bits

0aaddbff

Nonce

1,129,207,394

Timestamp

3/30/2017, 7:42:27 AM

Confirmations

4,773,063

Merkle Root

cd2c638495c3ac0cbf9cf27fa8327eef57c9dcb25b2bc8980d1a32f690e11d1b
Transactions (3)
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.

4.016 × 10⁹⁶(97-digit number)
40163002015862248005…97868884110338119679
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
4.016 × 10⁹⁶(97-digit number)
40163002015862248005…97868884110338119679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.032 × 10⁹⁶(97-digit number)
80326004031724496010…95737768220676239359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.606 × 10⁹⁷(98-digit number)
16065200806344899202…91475536441352478719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.213 × 10⁹⁷(98-digit number)
32130401612689798404…82951072882704957439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.426 × 10⁹⁷(98-digit number)
64260803225379596808…65902145765409914879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.285 × 10⁹⁸(99-digit number)
12852160645075919361…31804291530819829759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.570 × 10⁹⁸(99-digit number)
25704321290151838723…63608583061639659519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.140 × 10⁹⁸(99-digit number)
51408642580303677446…27217166123279319039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.028 × 10⁹⁹(100-digit number)
10281728516060735489…54434332246558638079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.056 × 10⁹⁹(100-digit number)
20563457032121470978…08868664493117276159
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,787,051 XPM·at block #6,817,873 · 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