Block #374,207

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/24/2014, 8:31:01 PM · Difficulty 10.4260 · 6,432,520 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
18b155e4bd770a759913d7cb27badbced9601f97fe0931d5812075ad11890069

Height

#374,207

Difficulty

10.426021

Transactions

8

Size

2.03 KB

Version

2

Bits

0a6d0fbc

Nonce

214,087

Timestamp

1/24/2014, 8:31:01 PM

Confirmations

6,432,520

Merkle Root

098b88c2a1402fc702989e1b37822efccb59c1a7331ceb8f5b3d3c7bb20812b0
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.971 × 10¹⁰⁰(101-digit number)
19717695454632926654…59941892523114531839
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.971 × 10¹⁰⁰(101-digit number)
19717695454632926654…59941892523114531839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.943 × 10¹⁰⁰(101-digit number)
39435390909265853309…19883785046229063679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.887 × 10¹⁰⁰(101-digit number)
78870781818531706619…39767570092458127359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.577 × 10¹⁰¹(102-digit number)
15774156363706341323…79535140184916254719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.154 × 10¹⁰¹(102-digit number)
31548312727412682647…59070280369832509439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.309 × 10¹⁰¹(102-digit number)
63096625454825365295…18140560739665018879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.261 × 10¹⁰²(103-digit number)
12619325090965073059…36281121479330037759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.523 × 10¹⁰²(103-digit number)
25238650181930146118…72562242958660075519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.047 × 10¹⁰²(103-digit number)
50477300363860292236…45124485917320151039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.009 × 10¹⁰³(104-digit number)
10095460072772058447…90248971834640302079
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,697,913 XPM·at block #6,806,726 · 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