Block #363,973

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2014, 6:31:11 PM · Difficulty 10.4183 · 6,444,087 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e9f1f257891270dd2e148cc574a522c28483827080fb5de59ef3c4a691af69f1

Height

#363,973

Difficulty

10.418344

Transactions

5

Size

1.09 KB

Version

2

Bits

0a6b1895

Nonce

31,530

Timestamp

1/17/2014, 6:31:11 PM

Confirmations

6,444,087

Merkle Root

ca92f072fdb42eb59e26e462f57e4680f7c98953abd83c824dd5afd4818d0cf1
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.155 × 10⁹⁹(100-digit number)
31559203996090134301…48197704418773793599
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.155 × 10⁹⁹(100-digit number)
31559203996090134301…48197704418773793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.311 × 10⁹⁹(100-digit number)
63118407992180268602…96395408837547587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.262 × 10¹⁰⁰(101-digit number)
12623681598436053720…92790817675095174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.524 × 10¹⁰⁰(101-digit number)
25247363196872107441…85581635350190348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.049 × 10¹⁰⁰(101-digit number)
50494726393744214882…71163270700380697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.009 × 10¹⁰¹(102-digit number)
10098945278748842976…42326541400761395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.019 × 10¹⁰¹(102-digit number)
20197890557497685952…84653082801522790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.039 × 10¹⁰¹(102-digit number)
40395781114995371905…69306165603045580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.079 × 10¹⁰¹(102-digit number)
80791562229990743811…38612331206091161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.615 × 10¹⁰²(103-digit number)
16158312445998148762…77224662412182323199
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,708,524 XPM·at block #6,808,059 · 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