Block #1,834,370

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/3/2016, 9:49:15 PM · Difficulty 10.6925 · 4,983,568 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f3f7c24cbe4353ee41f69e81396098bf399c992905df71f8977cf992e6c82d8e

Height

#1,834,370

Difficulty

10.692486

Transactions

3

Size

4.03 KB

Version

2

Bits

0ab146c1

Nonce

850,318,925

Timestamp

11/3/2016, 9:49:15 PM

Confirmations

4,983,568

Merkle Root

3d7312e1b1a91480be1bda1d970a75b9cca42458837286a1f93f55ad992c1590
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.

3.794 × 10⁹⁴(95-digit number)
37942910737298859493…03323543882654589319
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
3.794 × 10⁹⁴(95-digit number)
37942910737298859493…03323543882654589319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.588 × 10⁹⁴(95-digit number)
75885821474597718987…06647087765309178639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.517 × 10⁹⁵(96-digit number)
15177164294919543797…13294175530618357279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.035 × 10⁹⁵(96-digit number)
30354328589839087594…26588351061236714559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.070 × 10⁹⁵(96-digit number)
60708657179678175189…53176702122473429119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.214 × 10⁹⁶(97-digit number)
12141731435935635037…06353404244946858239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.428 × 10⁹⁶(97-digit number)
24283462871871270075…12706808489893716479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.856 × 10⁹⁶(97-digit number)
48566925743742540151…25413616979787432959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.713 × 10⁹⁶(97-digit number)
97133851487485080303…50827233959574865919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.942 × 10⁹⁷(98-digit number)
19426770297497016060…01654467919149731839
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,787,569 XPM·at block #6,817,937 · 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