Block #848,981

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2014, 12:10:45 PM · Difficulty 10.9713 · 5,992,876 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
58da83f6d7acf69eb984b30680eaa44ce62c2c4434ce4bc4a68b68f7b165e596

Height

#848,981

Difficulty

10.971328

Transactions

4

Size

2.57 KB

Version

2

Bits

0af8a8f7

Nonce

2,759,470,986

Timestamp

12/11/2014, 12:10:45 PM

Confirmations

5,992,876

Merkle Root

7de55ba113b3680c63692efdc1df8ebc9e9a8850f57982567dd21f042da66cc6
Transactions (4)
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.

9.804 × 10⁹³(94-digit number)
98046719493835452576…24487233636756854399
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
9.804 × 10⁹³(94-digit number)
98046719493835452576…24487233636756854399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.960 × 10⁹⁴(95-digit number)
19609343898767090515…48974467273513708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.921 × 10⁹⁴(95-digit number)
39218687797534181030…97948934547027417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.843 × 10⁹⁴(95-digit number)
78437375595068362061…95897869094054835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.568 × 10⁹⁵(96-digit number)
15687475119013672412…91795738188109670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.137 × 10⁹⁵(96-digit number)
31374950238027344824…83591476376219340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.274 × 10⁹⁵(96-digit number)
62749900476054689648…67182952752438681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.254 × 10⁹⁶(97-digit number)
12549980095210937929…34365905504877363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.509 × 10⁹⁶(97-digit number)
25099960190421875859…68731811009754726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.019 × 10⁹⁶(97-digit number)
50199920380843751719…37463622019509452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.003 × 10⁹⁷(98-digit number)
10039984076168750343…74927244039018905599
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,979,232 XPM·at block #6,841,856 · 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