Block #2,851,434

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/23/2018, 2:48:13 AM · Difficulty 11.7269 · 3,991,742 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
10eaf59167bcb5c54ca241943185ac3da06879536aaac7ad25ac41cb7f3098f3

Height

#2,851,434

Difficulty

11.726933

Transactions

5

Size

4.49 KB

Version

2

Bits

0bba1842

Nonce

1,390,514,669

Timestamp

9/23/2018, 2:48:13 AM

Confirmations

3,991,742

Merkle Root

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

5.275 × 10⁹⁵(96-digit number)
52751303362848636296…47041465335188677439
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
5.275 × 10⁹⁵(96-digit number)
52751303362848636296…47041465335188677439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.055 × 10⁹⁶(97-digit number)
10550260672569727259…94082930670377354879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.110 × 10⁹⁶(97-digit number)
21100521345139454518…88165861340754709759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.220 × 10⁹⁶(97-digit number)
42201042690278909037…76331722681509419519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.440 × 10⁹⁶(97-digit number)
84402085380557818074…52663445363018839039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.688 × 10⁹⁷(98-digit number)
16880417076111563614…05326890726037678079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.376 × 10⁹⁷(98-digit number)
33760834152223127229…10653781452075356159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.752 × 10⁹⁷(98-digit number)
67521668304446254459…21307562904150712319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.350 × 10⁹⁸(99-digit number)
13504333660889250891…42615125808301424639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.700 × 10⁹⁸(99-digit number)
27008667321778501783…85230251616602849279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.401 × 10⁹⁸(99-digit number)
54017334643557003567…70460503233205698559
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,989,774 XPM·at block #6,843,175 · 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