Block #2,855,942

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/26/2018, 3:16:48 PM · Difficulty 11.6948 · 3,977,392 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
019b2ae4b37d328d4fddf9d39ca3a91d46df66f3a2f479156056b09956bbacc9

Height

#2,855,942

Difficulty

11.694830

Transactions

6

Size

2.61 KB

Version

2

Bits

0bb1e05b

Nonce

1,310,231,205

Timestamp

9/26/2018, 3:16:48 PM

Confirmations

3,977,392

Merkle Root

c4844896e158ef6f0dee417c4f8aca83f9753c22594144a7d6bf9d68abf0d440
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.559 × 10⁹⁶(97-digit number)
25597112966689133067…59666849037006120959
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.559 × 10⁹⁶(97-digit number)
25597112966689133067…59666849037006120959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.119 × 10⁹⁶(97-digit number)
51194225933378266135…19333698074012241919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.023 × 10⁹⁷(98-digit number)
10238845186675653227…38667396148024483839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.047 × 10⁹⁷(98-digit number)
20477690373351306454…77334792296048967679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.095 × 10⁹⁷(98-digit number)
40955380746702612908…54669584592097935359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.191 × 10⁹⁷(98-digit number)
81910761493405225817…09339169184195870719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.638 × 10⁹⁸(99-digit number)
16382152298681045163…18678338368391741439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.276 × 10⁹⁸(99-digit number)
32764304597362090326…37356676736783482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.552 × 10⁹⁸(99-digit number)
65528609194724180653…74713353473566965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.310 × 10⁹⁹(100-digit number)
13105721838944836130…49426706947133931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.621 × 10⁹⁹(100-digit number)
26211443677889672261…98853413894267863039
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,910,867 XPM·at block #6,833,333 · 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