Block #934,874

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2015, 4:04:41 PM · Difficulty 10.9016 · 5,881,907 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9715d08f9c22cf78354e036ef43ccc5dd5144d75794f33df630dc06462083096

Height

#934,874

Difficulty

10.901591

Transactions

8

Size

3.62 KB

Version

2

Bits

0ae6cea3

Nonce

340,019,286

Timestamp

2/13/2015, 4:04:41 PM

Confirmations

5,881,907

Merkle Root

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

6.218 × 10⁹⁵(96-digit number)
62188770462705573595…93095388970981781439
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
6.218 × 10⁹⁵(96-digit number)
62188770462705573595…93095388970981781439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.243 × 10⁹⁶(97-digit number)
12437754092541114719…86190777941963562879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.487 × 10⁹⁶(97-digit number)
24875508185082229438…72381555883927125759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.975 × 10⁹⁶(97-digit number)
49751016370164458876…44763111767854251519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.950 × 10⁹⁶(97-digit number)
99502032740328917752…89526223535708503039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.990 × 10⁹⁷(98-digit number)
19900406548065783550…79052447071417006079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.980 × 10⁹⁷(98-digit number)
39800813096131567101…58104894142834012159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.960 × 10⁹⁷(98-digit number)
79601626192263134202…16209788285668024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.592 × 10⁹⁸(99-digit number)
15920325238452626840…32419576571336048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.184 × 10⁹⁸(99-digit number)
31840650476905253680…64839153142672097279
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,778,283 XPM·at block #6,816,780 · 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