Block #3,044,817

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/8/2019, 11:08:53 PM · Difficulty 11.0107 · 3,796,971 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb5f0e6e185d5d5e210c79f5db0e9ffc4e6a06c4c029cab6d3b673474d4741da

Height

#3,044,817

Difficulty

11.010691

Transactions

3

Size

3.49 KB

Version

2

Bits

0b02bca9

Nonce

132,187,136

Timestamp

2/8/2019, 11:08:53 PM

Confirmations

3,796,971

Merkle Root

9af536cdd4509ad22dcba3f32b53e11a1d4d91c666b0c4ea9ed7a1648f5f4de0
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.

1.735 × 10⁹⁴(95-digit number)
17350815686191060245…72951809058317342559
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.735 × 10⁹⁴(95-digit number)
17350815686191060245…72951809058317342559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.470 × 10⁹⁴(95-digit number)
34701631372382120490…45903618116634685119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.940 × 10⁹⁴(95-digit number)
69403262744764240981…91807236233269370239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.388 × 10⁹⁵(96-digit number)
13880652548952848196…83614472466538740479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.776 × 10⁹⁵(96-digit number)
27761305097905696392…67228944933077480959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.552 × 10⁹⁵(96-digit number)
55522610195811392785…34457889866154961919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.110 × 10⁹⁶(97-digit number)
11104522039162278557…68915779732309923839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.220 × 10⁹⁶(97-digit number)
22209044078324557114…37831559464619847679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.441 × 10⁹⁶(97-digit number)
44418088156649114228…75663118929239695359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.883 × 10⁹⁶(97-digit number)
88836176313298228456…51326237858479390719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.776 × 10⁹⁷(98-digit number)
17767235262659645691…02652475716958781439
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,978,682 XPM·at block #6,841,787 · 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