Block #869,916

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2014, 2:49:42 AM · Difficulty 10.9618 · 5,944,100 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1d11e321598a5d0e71975d339e9aa241b711a91b648ce731133a0b1d2d26f33

Height

#869,916

Difficulty

10.961788

Transactions

6

Size

1.30 KB

Version

2

Bits

0af637bd

Nonce

1,400,704,390

Timestamp

12/27/2014, 2:49:42 AM

Confirmations

5,944,100

Merkle Root

76b30c4dd62cc0e46a047bcaa974dc9f40df2041369149ab6f9a7672024d02ac
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.977 × 10⁹⁴(95-digit number)
19779773496636353846…75122435365416926399
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.977 × 10⁹⁴(95-digit number)
19779773496636353846…75122435365416926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.955 × 10⁹⁴(95-digit number)
39559546993272707693…50244870730833852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.911 × 10⁹⁴(95-digit number)
79119093986545415387…00489741461667705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.582 × 10⁹⁵(96-digit number)
15823818797309083077…00979482923335411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.164 × 10⁹⁵(96-digit number)
31647637594618166155…01958965846670822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.329 × 10⁹⁵(96-digit number)
63295275189236332310…03917931693341644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.265 × 10⁹⁶(97-digit number)
12659055037847266462…07835863386683289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.531 × 10⁹⁶(97-digit number)
25318110075694532924…15671726773366579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.063 × 10⁹⁶(97-digit number)
50636220151389065848…31343453546733158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.012 × 10⁹⁷(98-digit number)
10127244030277813169…62686907093466316799
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,756,212 XPM·at block #6,814,015 · 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