Block #352,256

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2014, 5:41:10 AM · Difficulty 10.3046 · 6,472,237 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7a0c434c28174bd28c596d7566713311de28c335e8fb85644109e8e9be0abd05

Height

#352,256

Difficulty

10.304599

Transactions

10

Size

2.79 KB

Version

2

Bits

0a4dfa2f

Nonce

32,704

Timestamp

1/10/2014, 5:41:10 AM

Confirmations

6,472,237

Merkle Root

78b3a10b43ab7a15665537acf6fce685f492c0c537fa8dc7dfff622655798bc8
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.

5.692 × 10⁹³(94-digit number)
56928169564203343745…16179937822270652479
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
5.692 × 10⁹³(94-digit number)
56928169564203343745…16179937822270652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.138 × 10⁹⁴(95-digit number)
11385633912840668749…32359875644541304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.277 × 10⁹⁴(95-digit number)
22771267825681337498…64719751289082609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.554 × 10⁹⁴(95-digit number)
45542535651362674996…29439502578165219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.108 × 10⁹⁴(95-digit number)
91085071302725349992…58879005156330439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.821 × 10⁹⁵(96-digit number)
18217014260545069998…17758010312660879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.643 × 10⁹⁵(96-digit number)
36434028521090139997…35516020625321758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.286 × 10⁹⁵(96-digit number)
72868057042180279994…71032041250643517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.457 × 10⁹⁶(97-digit number)
14573611408436055998…42064082501287034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.914 × 10⁹⁶(97-digit number)
29147222816872111997…84128165002574069759
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,840,016 XPM·at block #6,824,492 · 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