Block #849,493

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2014, 8:39:40 PM · Difficulty 10.9714 · 5,994,588 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f3fbd9f44de4ff9fbfd187eae2313c7d03cf18fb8b2e7b3121faf89cde85b244

Height

#849,493

Difficulty

10.971367

Transactions

10

Size

2.30 KB

Version

2

Bits

0af8ab89

Nonce

1,120,078,089

Timestamp

12/11/2014, 8:39:40 PM

Confirmations

5,994,588

Merkle Root

c9abd89cd7c4fa28f0d9ecde8888a763553eec4a576549a0b006fab2806eba93
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.

4.490 × 10⁹⁵(96-digit number)
44906867461152757668…56290014007499472799
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
4.490 × 10⁹⁵(96-digit number)
44906867461152757668…56290014007499472799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.981 × 10⁹⁵(96-digit number)
89813734922305515337…12580028014998945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.796 × 10⁹⁶(97-digit number)
17962746984461103067…25160056029997891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.592 × 10⁹⁶(97-digit number)
35925493968922206135…50320112059995782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.185 × 10⁹⁶(97-digit number)
71850987937844412270…00640224119991564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.437 × 10⁹⁷(98-digit number)
14370197587568882454…01280448239983129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.874 × 10⁹⁷(98-digit number)
28740395175137764908…02560896479966259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.748 × 10⁹⁷(98-digit number)
57480790350275529816…05121792959932518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.149 × 10⁹⁸(99-digit number)
11496158070055105963…10243585919865036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.299 × 10⁹⁸(99-digit number)
22992316140110211926…20487171839730073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.598 × 10⁹⁸(99-digit number)
45984632280220423853…40974343679460147199
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,997,023 XPM·at block #6,844,080 · 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