Block #2,831,058

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/9/2018, 1:26:05 AM · Difficulty 11.7188 · 3,996,052 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4c33514c5cc53c411418a42ebfc5f68f64bed96ec485290239521eeb501366ff

Height

#2,831,058

Difficulty

11.718839

Transactions

8

Size

1.86 KB

Version

2

Bits

0bb805cf

Nonce

383,058,500

Timestamp

9/9/2018, 1:26:05 AM

Confirmations

3,996,052

Merkle Root

1252085a1f0167bbba09e984ea226ae843c954a26987b7a0589e335d03d8427d
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.034 × 10⁹⁶(97-digit number)
20345827333973779145…28077074079567196159
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.034 × 10⁹⁶(97-digit number)
20345827333973779145…28077074079567196159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.069 × 10⁹⁶(97-digit number)
40691654667947558290…56154148159134392319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.138 × 10⁹⁶(97-digit number)
81383309335895116580…12308296318268784639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.627 × 10⁹⁷(98-digit number)
16276661867179023316…24616592636537569279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.255 × 10⁹⁷(98-digit number)
32553323734358046632…49233185273075138559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.510 × 10⁹⁷(98-digit number)
65106647468716093264…98466370546150277119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.302 × 10⁹⁸(99-digit number)
13021329493743218652…96932741092300554239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.604 × 10⁹⁸(99-digit number)
26042658987486437305…93865482184601108479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.208 × 10⁹⁸(99-digit number)
52085317974972874611…87730964369202216959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.041 × 10⁹⁹(100-digit number)
10417063594994574922…75461928738404433919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.083 × 10⁹⁹(100-digit number)
20834127189989149844…50923857476808867839
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,861,059 XPM·at block #6,827,109 · 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