Block #372,684

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/23/2014, 6:53:58 PM · Difficulty 10.4269 · 6,436,740 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2ea7d90a857a1b31fe6e7ad44b12a2d413c5ed5dbc7342e227e5ca8284a1257

Height

#372,684

Difficulty

10.426924

Transactions

2

Size

13.03 KB

Version

2

Bits

0a6d4ade

Nonce

38,964

Timestamp

1/23/2014, 6:53:58 PM

Confirmations

6,436,740

Merkle Root

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

8.346 × 10¹⁰²(103-digit number)
83464585144727142913…80230217394067596799
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
8.346 × 10¹⁰²(103-digit number)
83464585144727142913…80230217394067596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.669 × 10¹⁰³(104-digit number)
16692917028945428582…60460434788135193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.338 × 10¹⁰³(104-digit number)
33385834057890857165…20920869576270387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.677 × 10¹⁰³(104-digit number)
66771668115781714330…41841739152540774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.335 × 10¹⁰⁴(105-digit number)
13354333623156342866…83683478305081548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.670 × 10¹⁰⁴(105-digit number)
26708667246312685732…67366956610163097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.341 × 10¹⁰⁴(105-digit number)
53417334492625371464…34733913220326195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.068 × 10¹⁰⁵(106-digit number)
10683466898525074292…69467826440652390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.136 × 10¹⁰⁵(106-digit number)
21366933797050148585…38935652881304780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.273 × 10¹⁰⁵(106-digit number)
42733867594100297171…77871305762609561599
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,719,461 XPM·at block #6,809,423 · 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