Block #1,685,365

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/23/2016, 12:21:21 AM · Difficulty 10.7213 · 5,156,802 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
28cf195f445455e304bf9f39013293c583ac0f6e18ab01989fe89452962da30d

Height

#1,685,365

Difficulty

10.721328

Transactions

14

Size

4.04 KB

Version

2

Bits

0ab8a8ed

Nonce

244,397,450

Timestamp

7/23/2016, 12:21:21 AM

Confirmations

5,156,802

Merkle Root

ec4f0ee42e23a27d5236bc06b75bdd292be2b6d43f03b9fbe8c0afbcd8d40708
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.215 × 10⁹⁵(96-digit number)
12157342733020310333…72849008610041328639
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.215 × 10⁹⁵(96-digit number)
12157342733020310333…72849008610041328639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.431 × 10⁹⁵(96-digit number)
24314685466040620666…45698017220082657279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.862 × 10⁹⁵(96-digit number)
48629370932081241333…91396034440165314559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.725 × 10⁹⁵(96-digit number)
97258741864162482667…82792068880330629119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.945 × 10⁹⁶(97-digit number)
19451748372832496533…65584137760661258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.890 × 10⁹⁶(97-digit number)
38903496745664993067…31168275521322516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.780 × 10⁹⁶(97-digit number)
77806993491329986134…62336551042645032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.556 × 10⁹⁷(98-digit number)
15561398698265997226…24673102085290065919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.112 × 10⁹⁷(98-digit number)
31122797396531994453…49346204170580131839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.224 × 10⁹⁷(98-digit number)
62245594793063988907…98692408341160263679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.244 × 10⁹⁸(99-digit number)
12449118958612797781…97384816682320527359
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,981,727 XPM·at block #6,842,166 · 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