Block #487,164

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2014, 11:58:07 PM · Difficulty 10.6378 · 6,339,347 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9cc2f18fa751bc195cedc5e1303bd13898139e525344bd134deffa9e4859ebf1

Height

#487,164

Difficulty

10.637822

Transactions

11

Size

2.55 KB

Version

2

Bits

0aa34848

Nonce

37,594

Timestamp

4/11/2014, 11:58:07 PM

Confirmations

6,339,347

Merkle Root

6fd814960b973b005589675eca736d81bc78ee7b2cca8b996fb0a44e58ba168c
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.

2.357 × 10¹⁰²(103-digit number)
23572516421561256550…76918967061565311999
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
2.357 × 10¹⁰²(103-digit number)
23572516421561256550…76918967061565311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.714 × 10¹⁰²(103-digit number)
47145032843122513101…53837934123130623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.429 × 10¹⁰²(103-digit number)
94290065686245026203…07675868246261247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.885 × 10¹⁰³(104-digit number)
18858013137249005240…15351736492522495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.771 × 10¹⁰³(104-digit number)
37716026274498010481…30703472985044991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.543 × 10¹⁰³(104-digit number)
75432052548996020962…61406945970089983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.508 × 10¹⁰⁴(105-digit number)
15086410509799204192…22813891940179967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.017 × 10¹⁰⁴(105-digit number)
30172821019598408385…45627783880359935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.034 × 10¹⁰⁴(105-digit number)
60345642039196816770…91255567760719871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.206 × 10¹⁰⁵(106-digit number)
12069128407839363354…82511135521439743999
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,231 XPM·at block #6,826,510 · 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