Block #392,923

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/6/2014, 6:40:19 PM · Difficulty 10.4437 · 6,416,178 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec91ba12cd9cc5c335596dfa22e7796eeb7c6df74479f3725e59e16d100b7503

Height

#392,923

Difficulty

10.443687

Transactions

9

Size

1.97 KB

Version

2

Bits

0a71957f

Nonce

200,740

Timestamp

2/6/2014, 6:40:19 PM

Confirmations

6,416,178

Merkle Root

8f10bfe434f960a55d3ecdad13ab1d225bb671dad64eac40105dc926b51064b9
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.

1.615 × 10⁹⁸(99-digit number)
16150619135519201683…74208790156063654399
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
1.615 × 10⁹⁸(99-digit number)
16150619135519201683…74208790156063654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.230 × 10⁹⁸(99-digit number)
32301238271038403367…48417580312127308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.460 × 10⁹⁸(99-digit number)
64602476542076806735…96835160624254617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.292 × 10⁹⁹(100-digit number)
12920495308415361347…93670321248509235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.584 × 10⁹⁹(100-digit number)
25840990616830722694…87340642497018470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.168 × 10⁹⁹(100-digit number)
51681981233661445388…74681284994036940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.033 × 10¹⁰⁰(101-digit number)
10336396246732289077…49362569988073881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.067 × 10¹⁰⁰(101-digit number)
20672792493464578155…98725139976147763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.134 × 10¹⁰⁰(101-digit number)
41345584986929156311…97450279952295526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.269 × 10¹⁰⁰(101-digit number)
82691169973858312622…94900559904591052799
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,716,862 XPM·at block #6,809,100 · 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.

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