Block #364,901

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 9:20:55 AM · Difficulty 10.4236 · 6,460,047 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d425a83bc77214cd6cc4e8ca03ec40c0ffa93f2041f7b23e9dd099a38984b225

Height

#364,901

Difficulty

10.423561

Transactions

8

Size

2.04 KB

Version

2

Bits

0a6c6e7f

Nonce

88,576

Timestamp

1/18/2014, 9:20:55 AM

Confirmations

6,460,047

Merkle Root

c9fda41754ceab267e26bc6443ce4a69368af1b7368e1d762d257c364f7b8191
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.

2.706 × 10¹⁰¹(102-digit number)
27062911139348588486…97778311863171970559
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
2.706 × 10¹⁰¹(102-digit number)
27062911139348588486…97778311863171970559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.412 × 10¹⁰¹(102-digit number)
54125822278697176973…95556623726343941119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.082 × 10¹⁰²(103-digit number)
10825164455739435394…91113247452687882239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.165 × 10¹⁰²(103-digit number)
21650328911478870789…82226494905375764479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.330 × 10¹⁰²(103-digit number)
43300657822957741578…64452989810751528959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.660 × 10¹⁰²(103-digit number)
86601315645915483156…28905979621503057919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.732 × 10¹⁰³(104-digit number)
17320263129183096631…57811959243006115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.464 × 10¹⁰³(104-digit number)
34640526258366193262…15623918486012231679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.928 × 10¹⁰³(104-digit number)
69281052516732386525…31247836972024463359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.385 × 10¹⁰⁴(105-digit number)
13856210503346477305…62495673944048926719
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,843,662 XPM·at block #6,824,947 · 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