Block #468,808

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/31/2014, 6:22:23 PM · Difficulty 10.4331 · 6,357,784 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ffa96b01813042c55bdb50778ab58ba81e31c1a2d1b0b8440cf189e49add222c

Height

#468,808

Difficulty

10.433137

Transactions

6

Size

1.32 KB

Version

2

Bits

0a6ee210

Nonce

150,759

Timestamp

3/31/2014, 6:22:23 PM

Confirmations

6,357,784

Merkle Root

067ce8aad053e10e3ce793ce8afaa2defcc8a593479ecab4907f03a60cd7746d
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.

4.235 × 10¹⁰⁰(101-digit number)
42352911843295378958…87150901674032051279
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
4.235 × 10¹⁰⁰(101-digit number)
42352911843295378958…87150901674032051279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.470 × 10¹⁰⁰(101-digit number)
84705823686590757917…74301803348064102559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.694 × 10¹⁰¹(102-digit number)
16941164737318151583…48603606696128205119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.388 × 10¹⁰¹(102-digit number)
33882329474636303166…97207213392256410239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.776 × 10¹⁰¹(102-digit number)
67764658949272606333…94414426784512820479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.355 × 10¹⁰²(103-digit number)
13552931789854521266…88828853569025640959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.710 × 10¹⁰²(103-digit number)
27105863579709042533…77657707138051281919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.421 × 10¹⁰²(103-digit number)
54211727159418085066…55315414276102563839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.084 × 10¹⁰³(104-digit number)
10842345431883617013…10630828552205127679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.168 × 10¹⁰³(104-digit number)
21684690863767234026…21261657104410255359
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,856,888 XPM·at block #6,826,591 · 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