Block #842,985

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2014, 1:32:39 AM · Difficulty 10.9733 · 6,002,313 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21f400871e294ea279d5a5764cc339f1e0db31676a5d88da403a8d62b4e938eb

Height

#842,985

Difficulty

10.973349

Transactions

15

Size

3.39 KB

Version

2

Bits

0af92d67

Nonce

623,402,593

Timestamp

12/7/2014, 1:32:39 AM

Confirmations

6,002,313

Merkle Root

6a465f6bcef12f37300766cb21f6936c01dd7d5bd87cc8c880faf662e1758960
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.764 × 10⁹⁴(95-digit number)
37640318091384416069…75164203924745055999
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.764 × 10⁹⁴(95-digit number)
37640318091384416069…75164203924745055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.528 × 10⁹⁴(95-digit number)
75280636182768832139…50328407849490111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.505 × 10⁹⁵(96-digit number)
15056127236553766427…00656815698980223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.011 × 10⁹⁵(96-digit number)
30112254473107532855…01313631397960447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.022 × 10⁹⁵(96-digit number)
60224508946215065711…02627262795920895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.204 × 10⁹⁶(97-digit number)
12044901789243013142…05254525591841791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.408 × 10⁹⁶(97-digit number)
24089803578486026284…10509051183683583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.817 × 10⁹⁶(97-digit number)
48179607156972052569…21018102367367167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.635 × 10⁹⁶(97-digit number)
96359214313944105138…42036204734734335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.927 × 10⁹⁷(98-digit number)
19271842862788821027…84072409469468671999
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:58,006,823 XPM·at block #6,845,297 · 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