Block #364,452

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 2:10:05 AM · Difficulty 10.4214 · 6,473,783 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19f7c3c6b6ff54b8a545d5a2941acbc05c81dc4be25897db074dc224796823ea

Height

#364,452

Difficulty

10.421353

Transactions

2

Size

1.23 KB

Version

2

Bits

0a6bddcd

Nonce

400,020

Timestamp

1/18/2014, 2:10:05 AM

Confirmations

6,473,783

Merkle Root

683bb340a15413b09a89a1237872274eb6d23b01cac828ad129dd6de32e6413a
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.

3.997 × 10⁹⁴(95-digit number)
39975812212030448039…14682102325734963199
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
3.997 × 10⁹⁴(95-digit number)
39975812212030448039…14682102325734963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.995 × 10⁹⁴(95-digit number)
79951624424060896078…29364204651469926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.599 × 10⁹⁵(96-digit number)
15990324884812179215…58728409302939852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.198 × 10⁹⁵(96-digit number)
31980649769624358431…17456818605879705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.396 × 10⁹⁵(96-digit number)
63961299539248716862…34913637211759411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.279 × 10⁹⁶(97-digit number)
12792259907849743372…69827274423518822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.558 × 10⁹⁶(97-digit number)
25584519815699486745…39654548847037644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.116 × 10⁹⁶(97-digit number)
51169039631398973490…79309097694075289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.023 × 10⁹⁷(98-digit number)
10233807926279794698…58618195388150579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.046 × 10⁹⁷(98-digit number)
20467615852559589396…17236390776301158399
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,950,155 XPM·at block #6,838,234 · 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