Block #363,318

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2014, 8:21:16 AM · Difficulty 10.4128 · 6,479,496 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3a737e3e1d3f69a448f928c65c326ef100133a404a4a57924327b5dc21951f2c

Height

#363,318

Difficulty

10.412778

Transactions

1

Size

1.01 KB

Version

2

Bits

0a69abd9

Nonce

7,816

Timestamp

1/17/2014, 8:21:16 AM

Confirmations

6,479,496

Merkle Root

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

2.352 × 10⁹⁹(100-digit number)
23521871312756361879…06615629433444686559
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
2.352 × 10⁹⁹(100-digit number)
23521871312756361879…06615629433444686559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.704 × 10⁹⁹(100-digit number)
47043742625512723759…13231258866889373119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.408 × 10⁹⁹(100-digit number)
94087485251025447519…26462517733778746239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.881 × 10¹⁰⁰(101-digit number)
18817497050205089503…52925035467557492479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.763 × 10¹⁰⁰(101-digit number)
37634994100410179007…05850070935114984959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.526 × 10¹⁰⁰(101-digit number)
75269988200820358015…11700141870229969919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.505 × 10¹⁰¹(102-digit number)
15053997640164071603…23400283740459939839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.010 × 10¹⁰¹(102-digit number)
30107995280328143206…46800567480919879679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.021 × 10¹⁰¹(102-digit number)
60215990560656286412…93601134961839759359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.204 × 10¹⁰²(103-digit number)
12043198112131257282…87202269923679518719
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,986,852 XPM·at block #6,842,813 · 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