Block #857,659

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 12:10:49 AM · Difficulty 10.9675 · 5,969,650 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27aa27a9f55a9deb248ef7fbe234ce39d50f34ac82fd33edac74781dd43717d5

Height

#857,659

Difficulty

10.967456

Transactions

10

Size

3.02 KB

Version

2

Bits

0af7ab2a

Nonce

390,196,808

Timestamp

12/18/2014, 12:10:49 AM

Confirmations

5,969,650

Merkle Root

0c33956effed4c857dd85d675b07939123682f85407770bdf9b6d81832aa6517
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.032 × 10⁹⁴(95-digit number)
40325377332135744429…18778165756813146719
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.032 × 10⁹⁴(95-digit number)
40325377332135744429…18778165756813146719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.065 × 10⁹⁴(95-digit number)
80650754664271488858…37556331513626293439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.613 × 10⁹⁵(96-digit number)
16130150932854297771…75112663027252586879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.226 × 10⁹⁵(96-digit number)
32260301865708595543…50225326054505173759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.452 × 10⁹⁵(96-digit number)
64520603731417191086…00450652109010347519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.290 × 10⁹⁶(97-digit number)
12904120746283438217…00901304218020695039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.580 × 10⁹⁶(97-digit number)
25808241492566876434…01802608436041390079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.161 × 10⁹⁶(97-digit number)
51616482985133752869…03605216872082780159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.032 × 10⁹⁷(98-digit number)
10323296597026750573…07210433744165560319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.064 × 10⁹⁷(98-digit number)
20646593194053501147…14420867488331120639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.129 × 10⁹⁷(98-digit number)
41293186388107002295…28841734976662241279
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,862,584 XPM·at block #6,827,308 · 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