Block #332,243

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 9:54:32 PM · Difficulty 10.1743 · 6,478,654 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
74668ad10d444c583b5ba0a541de1ad32b58c909639b081c46e525517a1e5c4b

Height

#332,243

Difficulty

10.174341

Transactions

2

Size

573 B

Version

2

Bits

0a2ca19a

Nonce

42,802

Timestamp

12/27/2013, 9:54:32 PM

Confirmations

6,478,654

Merkle Root

7343ec4d34eedcc9f963cbc2ecb7b56e090900142378abb3e270be5dfb2c3c01
Transactions (2)
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.

3.039 × 10⁹²(93-digit number)
30390387704881129940…97423834531726932799
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
3.039 × 10⁹²(93-digit number)
30390387704881129940…97423834531726932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.078 × 10⁹²(93-digit number)
60780775409762259880…94847669063453865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.215 × 10⁹³(94-digit number)
12156155081952451976…89695338126907731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.431 × 10⁹³(94-digit number)
24312310163904903952…79390676253815462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.862 × 10⁹³(94-digit number)
48624620327809807904…58781352507630924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.724 × 10⁹³(94-digit number)
97249240655619615808…17562705015261849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.944 × 10⁹⁴(95-digit number)
19449848131123923161…35125410030523699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.889 × 10⁹⁴(95-digit number)
38899696262247846323…70250820061047398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.779 × 10⁹⁴(95-digit number)
77799392524495692646…40501640122094796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.555 × 10⁹⁵(96-digit number)
15559878504899138529…81003280244189593599
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,731,274 XPM·at block #6,810,896 · 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