Block #364,634

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 5:11:33 AM · Difficulty 10.4215 · 6,445,190 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0585f408c6512ed924008001cc1e48a1b16dfcaa2845f43881239b4a331d91bf

Height

#364,634

Difficulty

10.421519

Transactions

13

Size

4.73 KB

Version

2

Bits

0a6be8b1

Nonce

28,679

Timestamp

1/18/2014, 5:11:33 AM

Confirmations

6,445,190

Merkle Root

075743c39973e62329f653df335e1df47ef2c4d6da7f4131cc246624673a83d2
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.

4.104 × 10¹⁰⁰(101-digit number)
41043092736354033485…45235735918924897159
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
4.104 × 10¹⁰⁰(101-digit number)
41043092736354033485…45235735918924897159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.208 × 10¹⁰⁰(101-digit number)
82086185472708066970…90471471837849794319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.641 × 10¹⁰¹(102-digit number)
16417237094541613394…80942943675699588639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.283 × 10¹⁰¹(102-digit number)
32834474189083226788…61885887351399177279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.566 × 10¹⁰¹(102-digit number)
65668948378166453576…23771774702798354559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.313 × 10¹⁰²(103-digit number)
13133789675633290715…47543549405596709119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.626 × 10¹⁰²(103-digit number)
26267579351266581430…95087098811193418239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.253 × 10¹⁰²(103-digit number)
52535158702533162861…90174197622386836479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.050 × 10¹⁰³(104-digit number)
10507031740506632572…80348395244773672959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.101 × 10¹⁰³(104-digit number)
21014063481013265144…60696790489547345919
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,722,677 XPM·at block #6,809,823 · 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