Block #422,681

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/27/2014, 10:45:59 PM · Difficulty 10.3703 · 6,395,232 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f50c68f1ddecdbfc8b4292e65616d7f90ee0381e7e0a744bff5925ed757fe986

Height

#422,681

Difficulty

10.370348

Transactions

1

Size

1000 B

Version

2

Bits

0a5ecf1d

Nonce

132,159

Timestamp

2/27/2014, 10:45:59 PM

Confirmations

6,395,232

Merkle Root

41e08482d2e66cc5e79db0d4663e36c7c01a9a4223d125eaf6e93c6ede7c2d0c
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.310 × 10⁹¹(92-digit number)
13100565208251726634…39533893716124651519
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.310 × 10⁹¹(92-digit number)
13100565208251726634…39533893716124651519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.620 × 10⁹¹(92-digit number)
26201130416503453269…79067787432249303039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.240 × 10⁹¹(92-digit number)
52402260833006906539…58135574864498606079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.048 × 10⁹²(93-digit number)
10480452166601381307…16271149728997212159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.096 × 10⁹²(93-digit number)
20960904333202762615…32542299457994424319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.192 × 10⁹²(93-digit number)
41921808666405525231…65084598915988848639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.384 × 10⁹²(93-digit number)
83843617332811050463…30169197831977697279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.676 × 10⁹³(94-digit number)
16768723466562210092…60338395663955394559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.353 × 10⁹³(94-digit number)
33537446933124420185…20676791327910789119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.707 × 10⁹³(94-digit number)
67074893866248840370…41353582655821578239
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,787,368 XPM·at block #6,817,912 · 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