Block #456,273

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/23/2014, 2:52:02 AM · Difficulty 10.4165 · 6,353,914 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
46c819cdb9c7cfa1adbe4c13438474248b64e43377efce70155af4579705d20d

Height

#456,273

Difficulty

10.416519

Transactions

4

Size

2.72 KB

Version

2

Bits

0a6aa0fd

Nonce

13,617

Timestamp

3/23/2014, 2:52:02 AM

Confirmations

6,353,914

Merkle Root

78ddeb2713847cc99fea5db2daacdc2d1621d3a566d70f7225a6ef32816a5e50
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.

5.259 × 10⁹⁸(99-digit number)
52598888414337735929…70481766866884876799
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
5.259 × 10⁹⁸(99-digit number)
52598888414337735929…70481766866884876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.051 × 10⁹⁹(100-digit number)
10519777682867547185…40963533733769753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.103 × 10⁹⁹(100-digit number)
21039555365735094371…81927067467539507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.207 × 10⁹⁹(100-digit number)
42079110731470188743…63854134935079014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.415 × 10⁹⁹(100-digit number)
84158221462940377487…27708269870158028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.683 × 10¹⁰⁰(101-digit number)
16831644292588075497…55416539740316057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.366 × 10¹⁰⁰(101-digit number)
33663288585176150994…10833079480632115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.732 × 10¹⁰⁰(101-digit number)
67326577170352301989…21666158961264230399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.346 × 10¹⁰¹(102-digit number)
13465315434070460397…43332317922528460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.693 × 10¹⁰¹(102-digit number)
26930630868140920795…86664635845056921599
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,725,566 XPM·at block #6,810,186 · 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