Block #473,320

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2014, 7:49:50 PM · Difficulty 10.4472 · 6,333,651 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f774be0c59c204c16959588392895a3e32903512fc1a6e3064e3d48978053e7

Height

#473,320

Difficulty

10.447174

Transactions

2

Size

5.15 KB

Version

2

Bits

0a727a05

Nonce

100,366

Timestamp

4/3/2014, 7:49:50 PM

Confirmations

6,333,651

Merkle Root

bfa27a2f5f009bf22edcd7e39fd67c8375ecc0ca2ec0666e11e52b3f445987b9
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.

9.411 × 10¹⁰¹(102-digit number)
94118955013474941345…73387822414515702979
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
9.411 × 10¹⁰¹(102-digit number)
94118955013474941345…73387822414515702979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.882 × 10¹⁰²(103-digit number)
18823791002694988269…46775644829031405959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.764 × 10¹⁰²(103-digit number)
37647582005389976538…93551289658062811919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.529 × 10¹⁰²(103-digit number)
75295164010779953076…87102579316125623839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.505 × 10¹⁰³(104-digit number)
15059032802155990615…74205158632251247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.011 × 10¹⁰³(104-digit number)
30118065604311981230…48410317264502495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.023 × 10¹⁰³(104-digit number)
60236131208623962461…96820634529004990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.204 × 10¹⁰⁴(105-digit number)
12047226241724792492…93641269058009981439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.409 × 10¹⁰⁴(105-digit number)
24094452483449584984…87282538116019962879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.818 × 10¹⁰⁴(105-digit number)
48188904966899169969…74565076232039925759
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,699,868 XPM·at block #6,806,970 · 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