Block #332,412

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/28/2013, 12:46:28 AM · Difficulty 10.1740 · 6,477,212 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
883fe8147121f0f4dc1a2b8a3d506870175ff19fcf7e57278aa32ca5f95c5bf4

Height

#332,412

Difficulty

10.173988

Transactions

12

Size

3.70 KB

Version

2

Bits

0a2c8a80

Nonce

100,855

Timestamp

12/28/2013, 12:46:28 AM

Confirmations

6,477,212

Merkle Root

bd666bfa52fdbbbc7a9abd1a3c35e06823c1de9b50fad6788e0273c66b133973
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.105 × 10⁹⁷(98-digit number)
21055103485925959407…80282771318910986819
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.105 × 10⁹⁷(98-digit number)
21055103485925959407…80282771318910986819
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.211 × 10⁹⁷(98-digit number)
42110206971851918815…60565542637821973639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.422 × 10⁹⁷(98-digit number)
84220413943703837630…21131085275643947279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.684 × 10⁹⁸(99-digit number)
16844082788740767526…42262170551287894559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.368 × 10⁹⁸(99-digit number)
33688165577481535052…84524341102575789119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.737 × 10⁹⁸(99-digit number)
67376331154963070104…69048682205151578239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.347 × 10⁹⁹(100-digit number)
13475266230992614020…38097364410303156479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.695 × 10⁹⁹(100-digit number)
26950532461985228041…76194728820606312959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.390 × 10⁹⁹(100-digit number)
53901064923970456083…52389457641212625919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.078 × 10¹⁰⁰(101-digit number)
10780212984794091216…04778915282425251839
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,721,069 XPM·at block #6,809,623 · 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