Block #331,971

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 5:15:19 PM · Difficulty 10.1754 · 6,485,974 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f719918d604afa13abd50aa47f7f4cf84ef77f872a3554af59a54782a0f91acb

Height

#331,971

Difficulty

10.175422

Transactions

10

Size

3.24 KB

Version

2

Bits

0a2ce878

Nonce

9,955

Timestamp

12/27/2013, 5:15:19 PM

Confirmations

6,485,974

Merkle Root

9cc73db04a7bbeffbfb3c83d39f38607dbbb32892f502f6ebeb32fd2a25b2fc0
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.

9.615 × 10⁹⁸(99-digit number)
96152650130964502968…47651070353830369279
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
9.615 × 10⁹⁸(99-digit number)
96152650130964502968…47651070353830369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.923 × 10⁹⁹(100-digit number)
19230530026192900593…95302140707660738559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.846 × 10⁹⁹(100-digit number)
38461060052385801187…90604281415321477119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.692 × 10⁹⁹(100-digit number)
76922120104771602374…81208562830642954239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.538 × 10¹⁰⁰(101-digit number)
15384424020954320474…62417125661285908479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.076 × 10¹⁰⁰(101-digit number)
30768848041908640949…24834251322571816959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.153 × 10¹⁰⁰(101-digit number)
61537696083817281899…49668502645143633919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.230 × 10¹⁰¹(102-digit number)
12307539216763456379…99337005290287267839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.461 × 10¹⁰¹(102-digit number)
24615078433526912759…98674010580574535679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.923 × 10¹⁰¹(102-digit number)
49230156867053825519…97348021161149071359
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,787,627 XPM·at block #6,817,944 · 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