Block #2,809,067

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/25/2018, 8:57:34 AM · Difficulty 11.6668 · 4,034,764 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b0397ba8935e410f1468c2be6aeb47880f1e15c5ed39d19e68d52f05f3f8ce1e

Height

#2,809,067

Difficulty

11.666847

Transactions

35

Size

9.66 KB

Version

2

Bits

0baab67c

Nonce

579,288,030

Timestamp

8/25/2018, 8:57:34 AM

Confirmations

4,034,764

Merkle Root

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

3.204 × 10⁹⁶(97-digit number)
32047043968892256308…67897388483355558399
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
3.204 × 10⁹⁶(97-digit number)
32047043968892256308…67897388483355558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.409 × 10⁹⁶(97-digit number)
64094087937784512617…35794776966711116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.281 × 10⁹⁷(98-digit number)
12818817587556902523…71589553933422233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.563 × 10⁹⁷(98-digit number)
25637635175113805046…43179107866844467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.127 × 10⁹⁷(98-digit number)
51275270350227610093…86358215733688934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.025 × 10⁹⁸(99-digit number)
10255054070045522018…72716431467377868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.051 × 10⁹⁸(99-digit number)
20510108140091044037…45432862934755737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.102 × 10⁹⁸(99-digit number)
41020216280182088075…90865725869511475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.204 × 10⁹⁸(99-digit number)
82040432560364176150…81731451739022950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.640 × 10⁹⁹(100-digit number)
16408086512072835230…63462903478045900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.281 × 10⁹⁹(100-digit number)
32816173024145670460…26925806956091801599
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,995,024 XPM·at block #6,843,830 · 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