1. #6,809,7052CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #407,064

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 4:39:02 PM · Difficulty 10.4327 · 6,402,642 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9fae74313761a9c8351471ba0a91b7488398adf45b98c656563af9ce11e34e61

Height

#407,064

Difficulty

10.432689

Transactions

4

Size

2.42 KB

Version

2

Bits

0a6ec4bd

Nonce

80,046

Timestamp

2/16/2014, 4:39:02 PM

Confirmations

6,402,642

Merkle Root

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

2.170 × 10⁹²(93-digit number)
21700778602657724481…24650784774394545759
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
2.170 × 10⁹²(93-digit number)
21700778602657724481…24650784774394545759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.340 × 10⁹²(93-digit number)
43401557205315448962…49301569548789091519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.680 × 10⁹²(93-digit number)
86803114410630897924…98603139097578183039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.736 × 10⁹³(94-digit number)
17360622882126179584…97206278195156366079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.472 × 10⁹³(94-digit number)
34721245764252359169…94412556390312732159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.944 × 10⁹³(94-digit number)
69442491528504718339…88825112780625464319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.388 × 10⁹⁴(95-digit number)
13888498305700943667…77650225561250928639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.777 × 10⁹⁴(95-digit number)
27776996611401887335…55300451122501857279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.555 × 10⁹⁴(95-digit number)
55553993222803774671…10600902245003714559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.111 × 10⁹⁵(96-digit number)
11110798644560754934…21201804490007429119
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,721,727 XPM·at block #6,809,705 · 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