Block #393,817

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/7/2014, 10:34:52 AM · Difficulty 10.4370 · 6,421,051 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
76ce918876eb0d449d11ef8001e15fcc02020a844416debf2877b854469325b2

Height

#393,817

Difficulty

10.436952

Transactions

6

Size

20.25 KB

Version

2

Bits

0a6fdc16

Nonce

42,472

Timestamp

2/7/2014, 10:34:52 AM

Confirmations

6,421,051

Merkle Root

78ea2c6c1a7fe8f2883d1f91a5b66c3c4409fabeac01a2abd59545735927ff56
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.

7.985 × 10⁹⁴(95-digit number)
79859657491805899267…67403558318104924799
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
7.985 × 10⁹⁴(95-digit number)
79859657491805899267…67403558318104924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.597 × 10⁹⁵(96-digit number)
15971931498361179853…34807116636209849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.194 × 10⁹⁵(96-digit number)
31943862996722359707…69614233272419699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.388 × 10⁹⁵(96-digit number)
63887725993444719414…39228466544839398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.277 × 10⁹⁶(97-digit number)
12777545198688943882…78456933089678796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.555 × 10⁹⁶(97-digit number)
25555090397377887765…56913866179357593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.111 × 10⁹⁶(97-digit number)
51110180794755775531…13827732358715187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.022 × 10⁹⁷(98-digit number)
10222036158951155106…27655464717430374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.044 × 10⁹⁷(98-digit number)
20444072317902310212…55310929434860748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.088 × 10⁹⁷(98-digit number)
40888144635804620425…10621858869721497599
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,763,029 XPM·at block #6,814,867 · 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