Block #382,651

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/30/2014, 9:06:17 PM · Difficulty 10.4010 · 6,433,429 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ce70d0ca1dac183060445eceb35fa340d4c5859b36ed7dcd8a0c9a5bff4f4800

Height

#382,651

Difficulty

10.400990

Transactions

8

Size

2.46 KB

Version

2

Bits

0a66a745

Nonce

1,025,810

Timestamp

1/30/2014, 9:06:17 PM

Confirmations

6,433,429

Merkle Root

d820e73ce80d023e78cb7da482a73e3854ed2f1ddd56ab5c228523c9517a2207
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.

8.090 × 10⁹⁹(100-digit number)
80905398164750036944…27169704377094927999
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
8.090 × 10⁹⁹(100-digit number)
80905398164750036944…27169704377094927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.618 × 10¹⁰⁰(101-digit number)
16181079632950007388…54339408754189855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.236 × 10¹⁰⁰(101-digit number)
32362159265900014777…08678817508379711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.472 × 10¹⁰⁰(101-digit number)
64724318531800029555…17357635016759423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.294 × 10¹⁰¹(102-digit number)
12944863706360005911…34715270033518847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.588 × 10¹⁰¹(102-digit number)
25889727412720011822…69430540067037695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.177 × 10¹⁰¹(102-digit number)
51779454825440023644…38861080134075391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.035 × 10¹⁰²(103-digit number)
10355890965088004728…77722160268150783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.071 × 10¹⁰²(103-digit number)
20711781930176009457…55444320536301567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.142 × 10¹⁰²(103-digit number)
41423563860352018915…10888641072603135999
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,772,758 XPM·at block #6,816,079 · 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