Block #2,705,608

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2018, 11:04:53 PM · Difficulty 11.6188 · 4,136,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc10076fd0a6064f67a68e257dad7dd6c7da135b3d9de3b20b129253f55468f5

Height

#2,705,608

Difficulty

11.618848

Transactions

7

Size

2.37 KB

Version

2

Bits

0b9e6cd5

Nonce

442,479,940

Timestamp

6/14/2018, 11:04:53 PM

Confirmations

4,136,541

Merkle Root

62d49809e4338dc454e917e546bce01f14ff4ea7377858ee13aeadfe7c5aa220
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.926 × 10⁹⁶(97-digit number)
49263900112003222167…47251578224455270399
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.926 × 10⁹⁶(97-digit number)
49263900112003222167…47251578224455270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.852 × 10⁹⁶(97-digit number)
98527800224006444334…94503156448910540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.970 × 10⁹⁷(98-digit number)
19705560044801288866…89006312897821081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.941 × 10⁹⁷(98-digit number)
39411120089602577733…78012625795642163199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.882 × 10⁹⁷(98-digit number)
78822240179205155467…56025251591284326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.576 × 10⁹⁸(99-digit number)
15764448035841031093…12050503182568652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.152 × 10⁹⁸(99-digit number)
31528896071682062187…24101006365137305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.305 × 10⁹⁸(99-digit number)
63057792143364124374…48202012730274611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.261 × 10⁹⁹(100-digit number)
12611558428672824874…96404025460549222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.522 × 10⁹⁹(100-digit number)
25223116857345649749…92808050921098444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.044 × 10⁹⁹(100-digit number)
50446233714691299499…85616101842196889599
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,981,581 XPM·at block #6,842,148 · 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