Block #2,142,710

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/3/2017, 12:45:03 AM · Difficulty 10.8777 · 4,689,382 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d7946a734221b6c109a6f98a1240554867dc8567284c6c8ffd84059c4111c26d

Height

#2,142,710

Difficulty

10.877690

Transactions

2

Size

572 B

Version

2

Bits

0ae0b053

Nonce

1,629,867,725

Timestamp

6/3/2017, 12:45:03 AM

Confirmations

4,689,382

Merkle Root

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

6.666 × 10⁹⁵(96-digit number)
66667686682389240174…45668910270953455999
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
6.666 × 10⁹⁵(96-digit number)
66667686682389240174…45668910270953455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.333 × 10⁹⁶(97-digit number)
13333537336477848034…91337820541906911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.666 × 10⁹⁶(97-digit number)
26667074672955696069…82675641083813823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.333 × 10⁹⁶(97-digit number)
53334149345911392139…65351282167627647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.066 × 10⁹⁷(98-digit number)
10666829869182278427…30702564335255295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.133 × 10⁹⁷(98-digit number)
21333659738364556855…61405128670510591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.266 × 10⁹⁷(98-digit number)
42667319476729113711…22810257341021183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.533 × 10⁹⁷(98-digit number)
85334638953458227423…45620514682042367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.706 × 10⁹⁸(99-digit number)
17066927790691645484…91241029364084735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.413 × 10⁹⁸(99-digit number)
34133855581383290969…82482058728169471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.826 × 10⁹⁸(99-digit number)
68267711162766581938…64964117456338943999
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,900,865 XPM·at block #6,832,091 · 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