Block #849,815

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 1:57:32 AM · Difficulty 10.9714 · 5,994,067 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9f4018f303a38ebd8552bda973087a436ff7023a1e037e534bffd3fb83843109

Height

#849,815

Difficulty

10.971391

Transactions

6

Size

4.15 KB

Version

2

Bits

0af8ad10

Nonce

355,610,326

Timestamp

12/12/2014, 1:57:32 AM

Confirmations

5,994,067

Merkle Root

5b4c84d4df8885bcf4f640d4f5f3d0366631409dc5d4a60d7f4c3102bb7552f8
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.

2.746 × 10⁹⁵(96-digit number)
27465909108986095075…90066309049644127599
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
2.746 × 10⁹⁵(96-digit number)
27465909108986095075…90066309049644127599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.493 × 10⁹⁵(96-digit number)
54931818217972190151…80132618099288255199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.098 × 10⁹⁶(97-digit number)
10986363643594438030…60265236198576510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.197 × 10⁹⁶(97-digit number)
21972727287188876060…20530472397153020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.394 × 10⁹⁶(97-digit number)
43945454574377752121…41060944794306041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.789 × 10⁹⁶(97-digit number)
87890909148755504243…82121889588612083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.757 × 10⁹⁷(98-digit number)
17578181829751100848…64243779177224166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.515 × 10⁹⁷(98-digit number)
35156363659502201697…28487558354448332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.031 × 10⁹⁷(98-digit number)
70312727319004403394…56975116708896665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.406 × 10⁹⁸(99-digit number)
14062545463800880678…13950233417793331199
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,995,428 XPM·at block #6,843,881 · 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