Block #2,165,944

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/18/2017, 12:54:34 PM · Difficulty 10.8985 · 4,667,270 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
88b847b7cacb13b0d40af29bc4bedbbc6f6e9a4a8afd7ff14fefe2590b2b19fb

Height

#2,165,944

Difficulty

10.898504

Transactions

7

Size

3.46 KB

Version

2

Bits

0ae60459

Nonce

1,719,701,822

Timestamp

6/18/2017, 12:54:34 PM

Confirmations

4,667,270

Merkle Root

362babdb5f151508ef706bef7a038be047d19a8ed0b815218795e204024fb745
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.089 × 10⁹⁴(95-digit number)
10890192372848866247…88930695349453816239
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.089 × 10⁹⁴(95-digit number)
10890192372848866247…88930695349453816239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.178 × 10⁹⁴(95-digit number)
21780384745697732494…77861390698907632479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.356 × 10⁹⁴(95-digit number)
43560769491395464989…55722781397815264959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.712 × 10⁹⁴(95-digit number)
87121538982790929979…11445562795630529919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.742 × 10⁹⁵(96-digit number)
17424307796558185995…22891125591261059839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.484 × 10⁹⁵(96-digit number)
34848615593116371991…45782251182522119679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.969 × 10⁹⁵(96-digit number)
69697231186232743983…91564502365044239359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.393 × 10⁹⁶(97-digit number)
13939446237246548796…83129004730088478719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.787 × 10⁹⁶(97-digit number)
27878892474493097593…66258009460176957439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.575 × 10⁹⁶(97-digit number)
55757784948986195187…32516018920353914879
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,909,898 XPM·at block #6,833,213 · 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