Block #2,609,434

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2018, 2:42:51 PM · Difficulty 11.2281 · 4,223,013 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b0681d72ba57218cf6aba26c4f0c9b5de615ac43204fb87b72559acacb260636

Height

#2,609,434

Difficulty

11.228147

Transactions

7

Size

2.02 KB

Version

2

Bits

0b3a67dd

Nonce

1,581,178,822

Timestamp

4/11/2018, 2:42:51 PM

Confirmations

4,223,013

Merkle Root

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

1.333 × 10⁹⁴(95-digit number)
13334940182707251606…70334728356351603599
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
1.333 × 10⁹⁴(95-digit number)
13334940182707251606…70334728356351603599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.666 × 10⁹⁴(95-digit number)
26669880365414503213…40669456712703207199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.333 × 10⁹⁴(95-digit number)
53339760730829006426…81338913425406414399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.066 × 10⁹⁵(96-digit number)
10667952146165801285…62677826850812828799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.133 × 10⁹⁵(96-digit number)
21335904292331602570…25355653701625657599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.267 × 10⁹⁵(96-digit number)
42671808584663205141…50711307403251315199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.534 × 10⁹⁵(96-digit number)
85343617169326410282…01422614806502630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.706 × 10⁹⁶(97-digit number)
17068723433865282056…02845229613005260799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.413 × 10⁹⁶(97-digit number)
34137446867730564113…05690459226010521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.827 × 10⁹⁶(97-digit number)
68274893735461128226…11380918452021043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.365 × 10⁹⁷(98-digit number)
13654978747092225645…22761836904042086399
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,903,725 XPM·at block #6,832,446 · 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