Block #2,671,771

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/21/2018, 5:31:32 PM · Difficulty 11.6898 · 4,158,966 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
03787f3b374e7ed0c2627f92381a5f0c464a953b18f97eeb5e24a3f2d9bcf3a7

Height

#2,671,771

Difficulty

11.689776

Transactions

2

Size

869 B

Version

2

Bits

0bb09525

Nonce

1,008,318,286

Timestamp

5/21/2018, 5:31:32 PM

Confirmations

4,158,966

Merkle Root

3e10adb98e5ef5961a908bbbbd3af37652996d98a4e3bce8f7715f44c41e2621
Transactions (2)
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.035 × 10⁹³(94-digit number)
40355748006763145316…76255334729092227359
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.035 × 10⁹³(94-digit number)
40355748006763145316…76255334729092227359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.071 × 10⁹³(94-digit number)
80711496013526290633…52510669458184454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.614 × 10⁹⁴(95-digit number)
16142299202705258126…05021338916368909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.228 × 10⁹⁴(95-digit number)
32284598405410516253…10042677832737818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.456 × 10⁹⁴(95-digit number)
64569196810821032506…20085355665475637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.291 × 10⁹⁵(96-digit number)
12913839362164206501…40170711330951275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.582 × 10⁹⁵(96-digit number)
25827678724328413002…80341422661902551039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.165 × 10⁹⁵(96-digit number)
51655357448656826005…60682845323805102079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.033 × 10⁹⁶(97-digit number)
10331071489731365201…21365690647610204159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.066 × 10⁹⁶(97-digit number)
20662142979462730402…42731381295220408319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.132 × 10⁹⁶(97-digit number)
41324285958925460804…85462762590440816639
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,890,033 XPM·at block #6,830,736 · 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