Block #866,900

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/24/2014, 9:59:34 PM · Difficulty 10.9628 · 5,960,087 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dac75a5afcc04213c10c12500a6ad08762f36ec19b992d217752558a8aeebc46

Height

#866,900

Difficulty

10.962847

Transactions

4

Size

1.01 KB

Version

2

Bits

0af67d2c

Nonce

646,645,799

Timestamp

12/24/2014, 9:59:34 PM

Confirmations

5,960,087

Merkle Root

fa4a1318d990eb9264eee5a6a1533807dad6cbccf3667171548754aaed62de6a
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.639 × 10⁹⁶(97-digit number)
16391422638781163445…44557240015914044479
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.639 × 10⁹⁶(97-digit number)
16391422638781163445…44557240015914044479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.278 × 10⁹⁶(97-digit number)
32782845277562326890…89114480031828088959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.556 × 10⁹⁶(97-digit number)
65565690555124653780…78228960063656177919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13113138111024930756…56457920127312355839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.622 × 10⁹⁷(98-digit number)
26226276222049861512…12915840254624711679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.245 × 10⁹⁷(98-digit number)
52452552444099723024…25831680509249423359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.049 × 10⁹⁸(99-digit number)
10490510488819944604…51663361018498846719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.098 × 10⁹⁸(99-digit number)
20981020977639889209…03326722036997693439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.196 × 10⁹⁸(99-digit number)
41962041955279778419…06653444073995386879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.392 × 10⁹⁸(99-digit number)
83924083910559556838…13306888147990773759
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,860,071 XPM·at block #6,826,986 · 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