Block #845,044

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/8/2014, 2:26:00 PM · Difficulty 10.9726 · 5,979,573 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0646b64981bcdb39427bdc15bfe82784794306f1cf57a8f6909ce74f6b15f7ec

Height

#845,044

Difficulty

10.972594

Transactions

7

Size

1.67 KB

Version

2

Bits

0af8fbef

Nonce

668,832,328

Timestamp

12/8/2014, 2:26:00 PM

Confirmations

5,979,573

Merkle Root

1d737b8f58c5867d0217f606bb4c09ad710b84e14bd38b86115e5c67f26b07d7
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.780 × 10⁹⁶(97-digit number)
17807076530966881246…04321933635278863359
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.780 × 10⁹⁶(97-digit number)
17807076530966881246…04321933635278863359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.561 × 10⁹⁶(97-digit number)
35614153061933762492…08643867270557726719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.122 × 10⁹⁶(97-digit number)
71228306123867524985…17287734541115453439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.424 × 10⁹⁷(98-digit number)
14245661224773504997…34575469082230906879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.849 × 10⁹⁷(98-digit number)
28491322449547009994…69150938164461813759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.698 × 10⁹⁷(98-digit number)
56982644899094019988…38301876328923627519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.139 × 10⁹⁸(99-digit number)
11396528979818803997…76603752657847255039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.279 × 10⁹⁸(99-digit number)
22793057959637607995…53207505315694510079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.558 × 10⁹⁸(99-digit number)
45586115919275215990…06415010631389020159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.117 × 10⁹⁸(99-digit number)
91172231838550431981…12830021262778040319
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,840,997 XPM·at block #6,824,616 · 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