Block #452,925

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 9:51:29 PM · Difficulty 10.3927 · 6,357,844 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7c2b9b9be9ff72160537182c645b13a3cd9b304160ca292e1e95920d01eb97ab

Height

#452,925

Difficulty

10.392677

Transactions

2

Size

35.40 KB

Version

2

Bits

0a648679

Nonce

15,460

Timestamp

3/20/2014, 9:51:29 PM

Confirmations

6,357,844

Merkle Root

6d9d5bbada589aa7b7dc7828afe20bc6633d6f3f9189eed18de74234466466b9
Transactions (2)
1 in → 1 out9.6100 XPM116 B
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.217 × 10¹⁰¹(102-digit number)
12175603653439595344…95420424609540198399
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.217 × 10¹⁰¹(102-digit number)
12175603653439595344…95420424609540198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.435 × 10¹⁰¹(102-digit number)
24351207306879190689…90840849219080396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.870 × 10¹⁰¹(102-digit number)
48702414613758381379…81681698438160793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.740 × 10¹⁰¹(102-digit number)
97404829227516762759…63363396876321587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.948 × 10¹⁰²(103-digit number)
19480965845503352551…26726793752643174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.896 × 10¹⁰²(103-digit number)
38961931691006705103…53453587505286348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.792 × 10¹⁰²(103-digit number)
77923863382013410207…06907175010572697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.558 × 10¹⁰³(104-digit number)
15584772676402682041…13814350021145395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.116 × 10¹⁰³(104-digit number)
31169545352805364082…27628700042290790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.233 × 10¹⁰³(104-digit number)
62339090705610728165…55257400084581580799
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,730,247 XPM·at block #6,810,768 · 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