Block #463,036

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/27/2014, 7:59:17 PM · Difficulty 10.4181 · 6,346,671 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9269f38963bbedcd67585268cc75b36e937c1259ad4bdb2eb8892de7b4b4c85c

Height

#463,036

Difficulty

10.418091

Transactions

4

Size

1.01 KB

Version

2

Bits

0a6b0802

Nonce

32,789

Timestamp

3/27/2014, 7:59:17 PM

Confirmations

6,346,671

Merkle Root

398f148aa2202435ad1775a3bb510c2ebf6e05776b5c1041b5bdbcee26ab4aff
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.086 × 10⁹⁹(100-digit number)
30869353483341174104…98147585204280010319
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.086 × 10⁹⁹(100-digit number)
30869353483341174104…98147585204280010319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.173 × 10⁹⁹(100-digit number)
61738706966682348209…96295170408560020639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.234 × 10¹⁰⁰(101-digit number)
12347741393336469641…92590340817120041279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.469 × 10¹⁰⁰(101-digit number)
24695482786672939283…85180681634240082559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.939 × 10¹⁰⁰(101-digit number)
49390965573345878567…70361363268480165119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.878 × 10¹⁰⁰(101-digit number)
98781931146691757135…40722726536960330239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.975 × 10¹⁰¹(102-digit number)
19756386229338351427…81445453073920660479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.951 × 10¹⁰¹(102-digit number)
39512772458676702854…62890906147841320959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.902 × 10¹⁰¹(102-digit number)
79025544917353405708…25781812295682641919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.580 × 10¹⁰²(103-digit number)
15805108983470681141…51563624591365283839
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,735 XPM·at block #6,809,706 · 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