Block #360,933

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 6:06:13 PM · Difficulty 10.4016 · 6,464,017 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
99e2eb3ecf058defc027f9f5e0127600382091ee2913a28d8eb22f2dd6842650

Height

#360,933

Difficulty

10.401586

Transactions

10

Size

4.08 KB

Version

2

Bits

0a66ce57

Nonce

6,763

Timestamp

1/15/2014, 6:06:13 PM

Confirmations

6,464,017

Merkle Root

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

1.074 × 10⁹⁵(96-digit number)
10743952223753062839…84320674749545581439
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
1.074 × 10⁹⁵(96-digit number)
10743952223753062839…84320674749545581439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.148 × 10⁹⁵(96-digit number)
21487904447506125678…68641349499091162879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.297 × 10⁹⁵(96-digit number)
42975808895012251356…37282698998182325759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.595 × 10⁹⁵(96-digit number)
85951617790024502713…74565397996364651519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.719 × 10⁹⁶(97-digit number)
17190323558004900542…49130795992729303039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.438 × 10⁹⁶(97-digit number)
34380647116009801085…98261591985458606079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.876 × 10⁹⁶(97-digit number)
68761294232019602171…96523183970917212159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.375 × 10⁹⁷(98-digit number)
13752258846403920434…93046367941834424319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.750 × 10⁹⁷(98-digit number)
27504517692807840868…86092735883668848639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.500 × 10⁹⁷(98-digit number)
55009035385615681736…72185471767337697279
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,843,678 XPM·at block #6,824,949 · 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