1. #6,830,5542CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #349,311

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2014, 8:39:21 AM · Difficulty 10.2693 · 6,481,244 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2146ecaad208781a418c9a3cc5129f238873b75ccba5ec68a0c81a5856a5ed74

Height

#349,311

Difficulty

10.269316

Transactions

8

Size

4.98 KB

Version

2

Bits

0a44f1df

Nonce

6,162

Timestamp

1/8/2014, 8:39:21 AM

Confirmations

6,481,244

Merkle Root

44cfca83c140ee008a423585a4bc06d720da2d76b56ba31ab6014c19b64d5acc
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.979 × 10⁹⁴(95-digit number)
19797246085346189040…84043320661949544719
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.979 × 10⁹⁴(95-digit number)
19797246085346189040…84043320661949544719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.959 × 10⁹⁴(95-digit number)
39594492170692378081…68086641323899089439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.918 × 10⁹⁴(95-digit number)
79188984341384756162…36173282647798178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.583 × 10⁹⁵(96-digit number)
15837796868276951232…72346565295596357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.167 × 10⁹⁵(96-digit number)
31675593736553902465…44693130591192715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.335 × 10⁹⁵(96-digit number)
63351187473107804930…89386261182385431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.267 × 10⁹⁶(97-digit number)
12670237494621560986…78772522364770862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.534 × 10⁹⁶(97-digit number)
25340474989243121972…57545044729541724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.068 × 10⁹⁶(97-digit number)
50680949978486243944…15090089459083448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.013 × 10⁹⁷(98-digit number)
10136189995697248788…30180178918166896639
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,888,599 XPM·at block #6,830,554 · 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