Block #2,687,265

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2018, 2:11:47 PM · Difficulty 11.6811 · 4,155,320 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1729ee2d6be9751385cc6a0dbaf15109b8e36a4016c0ca49874122bbc2d9f134

Height

#2,687,265

Difficulty

11.681122

Transactions

3

Size

618 B

Version

2

Bits

0bae5e05

Nonce

422,562,242

Timestamp

6/1/2018, 2:11:47 PM

Confirmations

4,155,320

Merkle Root

e40de59ca14d8bb901960da8e8996bec3939d92793389fee2f672310df1d1788
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.853 × 10⁹⁵(96-digit number)
48533052215228672893…28825256161712619519
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.853 × 10⁹⁵(96-digit number)
48533052215228672893…28825256161712619519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.706 × 10⁹⁵(96-digit number)
97066104430457345787…57650512323425239039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.941 × 10⁹⁶(97-digit number)
19413220886091469157…15301024646850478079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.882 × 10⁹⁶(97-digit number)
38826441772182938314…30602049293700956159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.765 × 10⁹⁶(97-digit number)
77652883544365876629…61204098587401912319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.553 × 10⁹⁷(98-digit number)
15530576708873175325…22408197174803824639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.106 × 10⁹⁷(98-digit number)
31061153417746350651…44816394349607649279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.212 × 10⁹⁷(98-digit number)
62122306835492701303…89632788699215298559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.242 × 10⁹⁸(99-digit number)
12424461367098540260…79265577398430597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.484 × 10⁹⁸(99-digit number)
24848922734197080521…58531154796861194239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.969 × 10⁹⁸(99-digit number)
49697845468394161042…17062309593722388479
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,985,109 XPM·at block #6,842,584 · 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