Block #2,687,461

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2018, 5:42:55 PM · Difficulty 11.6802 · 4,152,351 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
544ded9264a5ff2388b21003c07915d0577bd901080218cd5dde351dda4f2ffd

Height

#2,687,461

Difficulty

11.680198

Transactions

5

Size

967 B

Version

2

Bits

0bae216e

Nonce

814,718,160

Timestamp

6/1/2018, 5:42:55 PM

Confirmations

4,152,351

Merkle Root

90423653dd1d210adf73101ad90fff4b6f9f0ec4c16e4b74c4f32a7bca3e23ef
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.

6.603 × 10⁹⁵(96-digit number)
66037290916957898526…05178638518356168799
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
6.603 × 10⁹⁵(96-digit number)
66037290916957898526…05178638518356168799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.320 × 10⁹⁶(97-digit number)
13207458183391579705…10357277036712337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.641 × 10⁹⁶(97-digit number)
26414916366783159410…20714554073424675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.282 × 10⁹⁶(97-digit number)
52829832733566318821…41429108146849350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.056 × 10⁹⁷(98-digit number)
10565966546713263764…82858216293698700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.113 × 10⁹⁷(98-digit number)
21131933093426527528…65716432587397401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.226 × 10⁹⁷(98-digit number)
42263866186853055057…31432865174794803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.452 × 10⁹⁷(98-digit number)
84527732373706110114…62865730349589606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.690 × 10⁹⁸(99-digit number)
16905546474741222022…25731460699179212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.381 × 10⁹⁸(99-digit number)
33811092949482444045…51462921398358425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.762 × 10⁹⁸(99-digit number)
67622185898964888091…02925842796716851199
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,962,789 XPM·at block #6,839,811 · 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