Block #364,331

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 12:07:33 AM · Difficulty 10.4213 · 6,479,207 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a742ecc392b6ac39180c96e80203f3b7092705804051f237b3393ec165f2660d

Height

#364,331

Difficulty

10.421302

Transactions

8

Size

1.78 KB

Version

2

Bits

0a6bda70

Nonce

13,236

Timestamp

1/18/2014, 12:07:33 AM

Confirmations

6,479,207

Merkle Root

fbef6bccfa7ad4812cc08de2271c67fc87d051af229f9befa9b49de8969b1f02
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.877 × 10¹⁰³(104-digit number)
18774130989630171929…94611152363461542399
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.877 × 10¹⁰³(104-digit number)
18774130989630171929…94611152363461542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.754 × 10¹⁰³(104-digit number)
37548261979260343859…89222304726923084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.509 × 10¹⁰³(104-digit number)
75096523958520687719…78444609453846169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.501 × 10¹⁰⁴(105-digit number)
15019304791704137543…56889218907692339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.003 × 10¹⁰⁴(105-digit number)
30038609583408275087…13778437815384678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.007 × 10¹⁰⁴(105-digit number)
60077219166816550175…27556875630769356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.201 × 10¹⁰⁵(106-digit number)
12015443833363310035…55113751261538713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.403 × 10¹⁰⁵(106-digit number)
24030887666726620070…10227502523077427199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.806 × 10¹⁰⁵(106-digit number)
48061775333453240140…20455005046154854399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.612 × 10¹⁰⁵(106-digit number)
96123550666906480280…40910010092309708799
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,992,679 XPM·at block #6,843,537 · 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