Block #467,062

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 1:05:12 PM · Difficulty 10.4335 · 6,345,982 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
289c91e00362b467905781067ecb15d0a44f37da78a945753781d1353eb15384

Height

#467,062

Difficulty

10.433495

Transactions

6

Size

1.67 KB

Version

2

Bits

0a6ef980

Nonce

1,566,828,513

Timestamp

3/30/2014, 1:05:12 PM

Confirmations

6,345,982

Merkle Root

0309b0db76352c705b8a568647b0ee1482977ce95484fff63ed7fd8f1bbd448c
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.947 × 10¹⁰⁹(110-digit number)
19479047187342438816…36378721709619281919
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.947 × 10¹⁰⁹(110-digit number)
19479047187342438816…36378721709619281919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.895 × 10¹⁰⁹(110-digit number)
38958094374684877632…72757443419238563839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.791 × 10¹⁰⁹(110-digit number)
77916188749369755265…45514886838477127679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.558 × 10¹¹⁰(111-digit number)
15583237749873951053…91029773676954255359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.116 × 10¹¹⁰(111-digit number)
31166475499747902106…82059547353908510719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.233 × 10¹¹⁰(111-digit number)
62332950999495804212…64119094707817021439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.246 × 10¹¹¹(112-digit number)
12466590199899160842…28238189415634042879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.493 × 10¹¹¹(112-digit number)
24933180399798321685…56476378831268085759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.986 × 10¹¹¹(112-digit number)
49866360799596643370…12952757662536171519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.973 × 10¹¹¹(112-digit number)
99732721599193286740…25905515325072343039
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,748,397 XPM·at block #6,813,043 · 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