Block #447,164

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/17/2014, 2:30:20 AM · Difficulty 10.3565 · 6,360,962 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eefcf58ad8662aafa758ed8973b54196f1ff9fe87965553974e81e194f80b89a

Height

#447,164

Difficulty

10.356495

Transactions

1

Size

1.01 KB

Version

2

Bits

0a5b4348

Nonce

255,440

Timestamp

3/17/2014, 2:30:20 AM

Confirmations

6,360,962

Merkle Root

4fd59e06e5ae59911ff1067e668597dcdb790a0617f8c491f5db1926d23bc8bf
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.

5.243 × 10⁹⁹(100-digit number)
52437876442239325495…59747285555002269899
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
5.243 × 10⁹⁹(100-digit number)
52437876442239325495…59747285555002269899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.048 × 10¹⁰⁰(101-digit number)
10487575288447865099…19494571110004539799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.097 × 10¹⁰⁰(101-digit number)
20975150576895730198…38989142220009079599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.195 × 10¹⁰⁰(101-digit number)
41950301153791460396…77978284440018159199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.390 × 10¹⁰⁰(101-digit number)
83900602307582920792…55956568880036318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.678 × 10¹⁰¹(102-digit number)
16780120461516584158…11913137760072636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.356 × 10¹⁰¹(102-digit number)
33560240923033168317…23826275520145273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.712 × 10¹⁰¹(102-digit number)
67120481846066336634…47652551040290547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.342 × 10¹⁰²(103-digit number)
13424096369213267326…95305102080581094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.684 × 10¹⁰²(103-digit number)
26848192738426534653…90610204161162188799
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,709,048 XPM·at block #6,808,125 · 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