Block #411,453

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2014, 6:46:26 PM · Difficulty 10.4288 · 6,415,523 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
84c463a6f7cfea8e96038d7ff1a5d76f90b47a22278f0c3e31137d021aedbb84

Height

#411,453

Difficulty

10.428809

Transactions

2

Size

1011 B

Version

2

Bits

0a6dc671

Nonce

3,513

Timestamp

2/19/2014, 6:46:26 PM

Confirmations

6,415,523

Merkle Root

a0ab723faa7fa6551b1ed317271c34197c56dfc97333ec78bb0f387d3327ed3c
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.

3.796 × 10⁹⁴(95-digit number)
37969792741304661733…88291037511795120639
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
3.796 × 10⁹⁴(95-digit number)
37969792741304661733…88291037511795120639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.593 × 10⁹⁴(95-digit number)
75939585482609323467…76582075023590241279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.518 × 10⁹⁵(96-digit number)
15187917096521864693…53164150047180482559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.037 × 10⁹⁵(96-digit number)
30375834193043729387…06328300094360965119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.075 × 10⁹⁵(96-digit number)
60751668386087458774…12656600188721930239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.215 × 10⁹⁶(97-digit number)
12150333677217491754…25313200377443860479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.430 × 10⁹⁶(97-digit number)
24300667354434983509…50626400754887720959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.860 × 10⁹⁶(97-digit number)
48601334708869967019…01252801509775441919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.720 × 10⁹⁶(97-digit number)
97202669417739934038…02505603019550883839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.944 × 10⁹⁷(98-digit number)
19440533883547986807…05011206039101767679
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,859,983 XPM·at block #6,826,975 · 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