Block #2,871,211

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/7/2018, 1:37:09 PM · Difficulty 11.6655 · 3,961,004 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
073ca2a643802d5092f7d4f7b1aa6b65c4319ea50f5d2a4676624b092fb1454d

Height

#2,871,211

Difficulty

11.665533

Transactions

28

Size

7.66 KB

Version

2

Bits

0baa6060

Nonce

725,468,575

Timestamp

10/7/2018, 1:37:09 PM

Confirmations

3,961,004

Merkle Root

ddd7a5bceb4a18973164afd56ee3c2286941cb7e75619857a416308a02bb4667
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.264 × 10⁹⁶(97-digit number)
22643348762862624277…35165435950509292799
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.264 × 10⁹⁶(97-digit number)
22643348762862624277…35165435950509292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.528 × 10⁹⁶(97-digit number)
45286697525725248555…70330871901018585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.057 × 10⁹⁶(97-digit number)
90573395051450497110…40661743802037171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.811 × 10⁹⁷(98-digit number)
18114679010290099422…81323487604074342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.622 × 10⁹⁷(98-digit number)
36229358020580198844…62646975208148684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.245 × 10⁹⁷(98-digit number)
72458716041160397688…25293950416297369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.449 × 10⁹⁸(99-digit number)
14491743208232079537…50587900832594739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.898 × 10⁹⁸(99-digit number)
28983486416464159075…01175801665189478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.796 × 10⁹⁸(99-digit number)
57966972832928318150…02351603330378956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.159 × 10⁹⁹(100-digit number)
11593394566585663630…04703206660757913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.318 × 10⁹⁹(100-digit number)
23186789133171327260…09406413321515827199
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,901,855 XPM·at block #6,832,214 · 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