Block #2,661,406

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/15/2018, 2:40:12 AM · Difficulty 11.6336 · 4,171,276 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2811bf60df7976877f7e573223f1b825a0e1c76b30cf747551bd6b32b6472a8

Height

#2,661,406

Difficulty

11.633567

Transactions

6

Size

2.90 KB

Version

2

Bits

0ba23177

Nonce

1,108,774,228

Timestamp

5/15/2018, 2:40:12 AM

Confirmations

4,171,276

Merkle Root

68b6ac0f90ef9254fe6e1669415e6c271c0f86fc1935f262469822d061d1980c
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.629 × 10⁹⁴(95-digit number)
26297736688934928277…30671373516643938719
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.629 × 10⁹⁴(95-digit number)
26297736688934928277…30671373516643938719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.259 × 10⁹⁴(95-digit number)
52595473377869856555…61342747033287877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.051 × 10⁹⁵(96-digit number)
10519094675573971311…22685494066575754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.103 × 10⁹⁵(96-digit number)
21038189351147942622…45370988133151509759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.207 × 10⁹⁵(96-digit number)
42076378702295885244…90741976266303019519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.415 × 10⁹⁵(96-digit number)
84152757404591770488…81483952532606039039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.683 × 10⁹⁶(97-digit number)
16830551480918354097…62967905065212078079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.366 × 10⁹⁶(97-digit number)
33661102961836708195…25935810130424156159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.732 × 10⁹⁶(97-digit number)
67322205923673416390…51871620260848312319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.346 × 10⁹⁷(98-digit number)
13464441184734683278…03743240521696624639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.692 × 10⁹⁷(98-digit number)
26928882369469366556…07486481043393249279
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,905,610 XPM·at block #6,832,681 · 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