Block #842,094

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2014, 9:12:15 AM · Difficulty 10.9738 · 5,999,795 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d90c1c82c77dc9a6ba13fe62b6115c566552ad0dd35962e0e18109e15ee77fed

Height

#842,094

Difficulty

10.973792

Transactions

2

Size

582 B

Version

2

Bits

0af94a77

Nonce

1,765,311,197

Timestamp

12/6/2014, 9:12:15 AM

Confirmations

5,999,795

Merkle Root

349f08579e60424db00c7236ee8001ef1686735336ecf00984792a376e1334da
Transactions (2)
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.

3.283 × 10⁹⁸(99-digit number)
32836791006210452889…82501189659937095679
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
3.283 × 10⁹⁸(99-digit number)
32836791006210452889…82501189659937095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.567 × 10⁹⁸(99-digit number)
65673582012420905779…65002379319874191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.313 × 10⁹⁹(100-digit number)
13134716402484181155…30004758639748382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.626 × 10⁹⁹(100-digit number)
26269432804968362311…60009517279496765439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.253 × 10⁹⁹(100-digit number)
52538865609936724623…20019034558993530879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.050 × 10¹⁰⁰(101-digit number)
10507773121987344924…40038069117987061759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.101 × 10¹⁰⁰(101-digit number)
21015546243974689849…80076138235974123519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.203 × 10¹⁰⁰(101-digit number)
42031092487949379699…60152276471948247039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.406 × 10¹⁰⁰(101-digit number)
84062184975898759398…20304552943896494079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.681 × 10¹⁰¹(102-digit number)
16812436995179751879…40609105887792988159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.362 × 10¹⁰¹(102-digit number)
33624873990359503759…81218211775585976319
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,979,489 XPM·at block #6,841,888 · 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