Block #879,458

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2015, 4:50:05 PM · Difficulty 10.9625 · 5,951,779 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6c92dbd562cd58da45b8b02ed48cf8791a0e8e58a2e4656b0a05c1c538e27a58

Height

#879,458

Difficulty

10.962547

Transactions

5

Size

1.95 KB

Version

2

Bits

0af66980

Nonce

1,511,450,747

Timestamp

1/2/2015, 4:50:05 PM

Confirmations

5,951,779

Merkle Root

e18300d6b452b18376e4ef98d410957427d8d7885ac5ff2cc432e516ce362a8b
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.651 × 10⁹⁶(97-digit number)
16512409701260801083…53586764675718060159
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.651 × 10⁹⁶(97-digit number)
16512409701260801083…53586764675718060159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.302 × 10⁹⁶(97-digit number)
33024819402521602166…07173529351436120319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.604 × 10⁹⁶(97-digit number)
66049638805043204332…14347058702872240639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.320 × 10⁹⁷(98-digit number)
13209927761008640866…28694117405744481279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.641 × 10⁹⁷(98-digit number)
26419855522017281732…57388234811488962559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.283 × 10⁹⁷(98-digit number)
52839711044034563465…14776469622977925119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.056 × 10⁹⁸(99-digit number)
10567942208806912693…29552939245955850239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.113 × 10⁹⁸(99-digit number)
21135884417613825386…59105878491911700479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.227 × 10⁹⁸(99-digit number)
42271768835227650772…18211756983823400959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.454 × 10⁹⁸(99-digit number)
84543537670455301545…36423513967646801919
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,894,045 XPM·at block #6,831,236 · 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