Block #2,811,568

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2018, 2:18:06 AM · Difficulty 11.6682 · 4,031,823 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5277b8dd52bc87ae42b8d79d27ba04acc54508af34da9706636abe20d9ce9fa8

Height

#2,811,568

Difficulty

11.668171

Transactions

2

Size

459 B

Version

2

Bits

0bab0d48

Nonce

1,542,533,782

Timestamp

8/27/2018, 2:18:06 AM

Confirmations

4,031,823

Merkle Root

82271fb171520199e846f133303d07795eb076cc0765850266d80bb92b79f28e
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.040 × 10⁹⁴(95-digit number)
10407504486589669958…93399888287972553599
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.040 × 10⁹⁴(95-digit number)
10407504486589669958…93399888287972553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.081 × 10⁹⁴(95-digit number)
20815008973179339916…86799776575945107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.163 × 10⁹⁴(95-digit number)
41630017946358679832…73599553151890214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.326 × 10⁹⁴(95-digit number)
83260035892717359665…47199106303780428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.665 × 10⁹⁵(96-digit number)
16652007178543471933…94398212607560857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.330 × 10⁹⁵(96-digit number)
33304014357086943866…88796425215121715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.660 × 10⁹⁵(96-digit number)
66608028714173887732…77592850430243430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.332 × 10⁹⁶(97-digit number)
13321605742834777546…55185700860486860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.664 × 10⁹⁶(97-digit number)
26643211485669555093…10371401720973721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.328 × 10⁹⁶(97-digit number)
53286422971339110186…20742803441947443199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.065 × 10⁹⁷(98-digit number)
10657284594267822037…41485606883894886399
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,991,494 XPM·at block #6,843,390 · 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