Block #364,956

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 10:25:09 AM · Difficulty 10.4224 · 6,451,313 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cfb4f184a60a5373cd4b486d5e6941c5dc9f420580550e176ed11ede3d6fc7e5

Height

#364,956

Difficulty

10.422352

Transactions

10

Size

2.45 KB

Version

2

Bits

0a6c1f42

Nonce

5,379

Timestamp

1/18/2014, 10:25:09 AM

Confirmations

6,451,313

Merkle Root

5c2d04a23b0655d6835bd71ebd16ea9ee2a80b23c4701bdbb961048a718ec652
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.545 × 10¹⁰⁵(106-digit number)
45456755904331334686…80263793586916556799
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.545 × 10¹⁰⁵(106-digit number)
45456755904331334686…80263793586916556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.091 × 10¹⁰⁵(106-digit number)
90913511808662669373…60527587173833113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.818 × 10¹⁰⁶(107-digit number)
18182702361732533874…21055174347666227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.636 × 10¹⁰⁶(107-digit number)
36365404723465067749…42110348695332454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.273 × 10¹⁰⁶(107-digit number)
72730809446930135498…84220697390664908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.454 × 10¹⁰⁷(108-digit number)
14546161889386027099…68441394781329817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.909 × 10¹⁰⁷(108-digit number)
29092323778772054199…36882789562659635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.818 × 10¹⁰⁷(108-digit number)
58184647557544108398…73765579125319270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.163 × 10¹⁰⁸(109-digit number)
11636929511508821679…47531158250638540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.327 × 10¹⁰⁸(109-digit number)
23273859023017643359…95062316501277081599
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,774,266 XPM·at block #6,816,268 · 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