Block #468,096

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/31/2014, 6:52:31 AM · Difficulty 10.4306 · 6,340,876 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
00a248758055a560a89ed132a0fc81ea306ef31f197d41def0a690c2a5ac051a

Height

#468,096

Difficulty

10.430571

Transactions

4

Size

2.19 KB

Version

2

Bits

0a6e39e6

Nonce

83,343

Timestamp

3/31/2014, 6:52:31 AM

Confirmations

6,340,876

Merkle Root

903cf79d5a00b692649793eecccc7c9dedcc139ec7d380f12ee3149466642f00
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.678 × 10¹⁰²(103-digit number)
16788768452651180319…94751030553330158079
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.678 × 10¹⁰²(103-digit number)
16788768452651180319…94751030553330158079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.357 × 10¹⁰²(103-digit number)
33577536905302360639…89502061106660316159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.715 × 10¹⁰²(103-digit number)
67155073810604721279…79004122213320632319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.343 × 10¹⁰³(104-digit number)
13431014762120944255…58008244426641264639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.686 × 10¹⁰³(104-digit number)
26862029524241888511…16016488853282529279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.372 × 10¹⁰³(104-digit number)
53724059048483777023…32032977706565058559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.074 × 10¹⁰⁴(105-digit number)
10744811809696755404…64065955413130117119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.148 × 10¹⁰⁴(105-digit number)
21489623619393510809…28131910826260234239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.297 × 10¹⁰⁴(105-digit number)
42979247238787021618…56263821652520468479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.595 × 10¹⁰⁴(105-digit number)
85958494477574043237…12527643305040936959
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,715,831 XPM·at block #6,808,971 · 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