Block #2,311,797

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/27/2017, 8:02:59 PM · Difficulty 10.9062 · 4,531,200 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b322a8999947d473a57a6ce49e61680de964b6368009d4a40e4f71b7dc8c8788

Height

#2,311,797

Difficulty

10.906201

Transactions

2

Size

1.09 KB

Version

2

Bits

0ae7fcc3

Nonce

666,560,735

Timestamp

9/27/2017, 8:02:59 PM

Confirmations

4,531,200

Merkle Root

f22f21a85b58b6b6798942d81aaf430364c25a3eabd5b3e622a855381dfc3c05
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.

7.149 × 10⁹⁴(95-digit number)
71490011077791329184…55438780048865035519
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
7.149 × 10⁹⁴(95-digit number)
71490011077791329184…55438780048865035519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.429 × 10⁹⁵(96-digit number)
14298002215558265836…10877560097730071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.859 × 10⁹⁵(96-digit number)
28596004431116531673…21755120195460142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.719 × 10⁹⁵(96-digit number)
57192008862233063347…43510240390920284159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.143 × 10⁹⁶(97-digit number)
11438401772446612669…87020480781840568319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.287 × 10⁹⁶(97-digit number)
22876803544893225339…74040961563681136639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.575 × 10⁹⁶(97-digit number)
45753607089786450678…48081923127362273279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.150 × 10⁹⁶(97-digit number)
91507214179572901356…96163846254724546559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.830 × 10⁹⁷(98-digit number)
18301442835914580271…92327692509449093119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.660 × 10⁹⁷(98-digit number)
36602885671829160542…84655385018898186239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.320 × 10⁹⁷(98-digit number)
73205771343658321085…69310770037796372479
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,988,331 XPM·at block #6,842,996 · 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