Block #460,530

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2014, 2:18:27 AM · Difficulty 10.4158 · 6,366,233 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
662caa2d7163351ca4e04a7cb684d1d0eb798e3abe794c5eeb6e984b2903697f

Height

#460,530

Difficulty

10.415848

Transactions

7

Size

1.52 KB

Version

2

Bits

0a6a7500

Nonce

1,376,430

Timestamp

3/26/2014, 2:18:27 AM

Confirmations

6,366,233

Merkle Root

97445383b1dea60c65f783454e7a11f751dd9a1096d1469996b13d71ef349317
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.869 × 10⁹⁴(95-digit number)
18691002731762465050…61666670884093124499
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.869 × 10⁹⁴(95-digit number)
18691002731762465050…61666670884093124499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.738 × 10⁹⁴(95-digit number)
37382005463524930101…23333341768186248999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.476 × 10⁹⁴(95-digit number)
74764010927049860202…46666683536372497999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.495 × 10⁹⁵(96-digit number)
14952802185409972040…93333367072744995999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.990 × 10⁹⁵(96-digit number)
29905604370819944081…86666734145489991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.981 × 10⁹⁵(96-digit number)
59811208741639888162…73333468290979983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.196 × 10⁹⁶(97-digit number)
11962241748327977632…46666936581959967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.392 × 10⁹⁶(97-digit number)
23924483496655955264…93333873163919935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.784 × 10⁹⁶(97-digit number)
47848966993311910529…86667746327839871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.569 × 10⁹⁶(97-digit number)
95697933986623821059…73335492655679743999
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,858,264 XPM·at block #6,826,762 · 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