Block #352,363

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2014, 7:14:23 AM · Difficulty 10.3066 · 6,462,689 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e8ae98adb76fefdcdde1921916458071f6ea36f80e736f7ebbac09590391b17b

Height

#352,363

Difficulty

10.306582

Transactions

7

Size

2.11 KB

Version

2

Bits

0a4e7c2b

Nonce

138,484

Timestamp

1/10/2014, 7:14:23 AM

Confirmations

6,462,689

Merkle Root

d817720604d5e7c95dced98fd8ac691ce1594df78a496db95d491f98998b7da5
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.131 × 10⁹⁵(96-digit number)
31311079016537549267…16666023761605141759
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.131 × 10⁹⁵(96-digit number)
31311079016537549267…16666023761605141759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.262 × 10⁹⁵(96-digit number)
62622158033075098534…33332047523210283519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.252 × 10⁹⁶(97-digit number)
12524431606615019706…66664095046420567039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.504 × 10⁹⁶(97-digit number)
25048863213230039413…33328190092841134079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.009 × 10⁹⁶(97-digit number)
50097726426460078827…66656380185682268159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.001 × 10⁹⁷(98-digit number)
10019545285292015765…33312760371364536319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.003 × 10⁹⁷(98-digit number)
20039090570584031531…66625520742729072639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.007 × 10⁹⁷(98-digit number)
40078181141168063062…33251041485458145279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.015 × 10⁹⁷(98-digit number)
80156362282336126124…66502082970916290559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.603 × 10⁹⁸(99-digit number)
16031272456467225224…33004165941832581119
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,764,507 XPM·at block #6,815,051 · 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