Block #858,594

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 6:11:35 PM · Difficulty 10.9665 · 5,975,302 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
abf2d3673c20051522c76c7c494490e5d3ab10a0f8e50d20ef0b81b4d822cd1f

Height

#858,594

Difficulty

10.966532

Transactions

17

Size

4.18 KB

Version

2

Bits

0af76ea4

Nonce

196,963,901

Timestamp

12/18/2014, 6:11:35 PM

Confirmations

5,975,302

Merkle Root

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

4.994 × 10⁹⁵(96-digit number)
49943035743589543896…40753765872423880959
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
4.994 × 10⁹⁵(96-digit number)
49943035743589543896…40753765872423880959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.988 × 10⁹⁵(96-digit number)
99886071487179087793…81507531744847761919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.997 × 10⁹⁶(97-digit number)
19977214297435817558…63015063489695523839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.995 × 10⁹⁶(97-digit number)
39954428594871635117…26030126979391047679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.990 × 10⁹⁶(97-digit number)
79908857189743270234…52060253958782095359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.598 × 10⁹⁷(98-digit number)
15981771437948654046…04120507917564190719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.196 × 10⁹⁷(98-digit number)
31963542875897308093…08241015835128381439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.392 × 10⁹⁷(98-digit number)
63927085751794616187…16482031670256762879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.278 × 10⁹⁸(99-digit number)
12785417150358923237…32964063340513525759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.557 × 10⁹⁸(99-digit number)
25570834300717846475…65928126681027051519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.114 × 10⁹⁸(99-digit number)
51141668601435692950…31856253362054103039
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,915,392 XPM·at block #6,833,895 · 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