Block #858,282

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 12:07:29 PM · Difficulty 10.9669 · 5,978,288 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c621e7e15858747c1606a168edb3dd000ecdbda65090db1f5d2bcc0fa7dcb8be

Height

#858,282

Difficulty

10.966862

Transactions

17

Size

5.29 KB

Version

2

Bits

0af78447

Nonce

39,812,894

Timestamp

12/18/2014, 12:07:29 PM

Confirmations

5,978,288

Merkle Root

9a94106dd04075167b624fd391b60381a055459567fa0750b3525fcf9bd92780
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.299 × 10⁹⁸(99-digit number)
32997534014316386298…92156945602884915199
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.299 × 10⁹⁸(99-digit number)
32997534014316386298…92156945602884915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.599 × 10⁹⁸(99-digit number)
65995068028632772596…84313891205769830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.319 × 10⁹⁹(100-digit number)
13199013605726554519…68627782411539660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.639 × 10⁹⁹(100-digit number)
26398027211453109038…37255564823079321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.279 × 10⁹⁹(100-digit number)
52796054422906218077…74511129646158643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.055 × 10¹⁰⁰(101-digit number)
10559210884581243615…49022259292317286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.111 × 10¹⁰⁰(101-digit number)
21118421769162487230…98044518584634572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.223 × 10¹⁰⁰(101-digit number)
42236843538324974461…96089037169269145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.447 × 10¹⁰⁰(101-digit number)
84473687076649948923…92178074338538291199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.689 × 10¹⁰¹(102-digit number)
16894737415329989784…84356148677076582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.378 × 10¹⁰¹(102-digit number)
33789474830659979569…68712297354153164799
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,936,825 XPM·at block #6,836,569 · 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