1. #6,807,8762CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #381,525

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/30/2014, 1:56:13 AM · Difficulty 10.4033 · 6,426,351 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
118607c542d8768db7aeceb3364ba509ead74f184583ba3ca838e4d8367b0cca

Height

#381,525

Difficulty

10.403303

Transactions

5

Size

1.29 KB

Version

2

Bits

0a673ed7

Nonce

13,170

Timestamp

1/30/2014, 1:56:13 AM

Confirmations

6,426,351

Merkle Root

de7b049bc29aed25ff6b231aa717f9e62f058d191513e4bc3086efccbd44535f
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.085 × 10⁹⁴(95-digit number)
10850717582774562085…46956881068486467599
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.085 × 10⁹⁴(95-digit number)
10850717582774562085…46956881068486467599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.170 × 10⁹⁴(95-digit number)
21701435165549124170…93913762136972935199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.340 × 10⁹⁴(95-digit number)
43402870331098248341…87827524273945870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.680 × 10⁹⁴(95-digit number)
86805740662196496683…75655048547891740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.736 × 10⁹⁵(96-digit number)
17361148132439299336…51310097095783481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.472 × 10⁹⁵(96-digit number)
34722296264878598673…02620194191566963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.944 × 10⁹⁵(96-digit number)
69444592529757197346…05240388383133926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.388 × 10⁹⁶(97-digit number)
13888918505951439469…10480776766267852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.777 × 10⁹⁶(97-digit number)
27777837011902878938…20961553532535705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.555 × 10⁹⁶(97-digit number)
55555674023805757877…41923107065071411199
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,707,042 XPM·at block #6,807,875 · 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