Block #355,910

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2014, 10:58:05 AM · Difficulty 10.3666 · 6,461,474 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb44aad30b104ee99e2e4564d77d853ecba9e58d6744a01431150b2a60862184

Height

#355,910

Difficulty

10.366624

Transactions

4

Size

1.32 KB

Version

2

Bits

0a5ddb17

Nonce

35,408

Timestamp

1/12/2014, 10:58:05 AM

Confirmations

6,461,474

Merkle Root

9c4b9e510f9fee7a06171feb27397fc2d684e05a4cae054ed5f0848e6bfdbd7d
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.428 × 10¹⁰³(104-digit number)
24280664907794397651…18311610528731397119
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.428 × 10¹⁰³(104-digit number)
24280664907794397651…18311610528731397119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.856 × 10¹⁰³(104-digit number)
48561329815588795302…36623221057462794239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.712 × 10¹⁰³(104-digit number)
97122659631177590604…73246442114925588479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.942 × 10¹⁰⁴(105-digit number)
19424531926235518120…46492884229851176959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.884 × 10¹⁰⁴(105-digit number)
38849063852471036241…92985768459702353919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.769 × 10¹⁰⁴(105-digit number)
77698127704942072483…85971536919404707839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.553 × 10¹⁰⁵(106-digit number)
15539625540988414496…71943073838809415679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.107 × 10¹⁰⁵(106-digit number)
31079251081976828993…43886147677618831359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.215 × 10¹⁰⁵(106-digit number)
62158502163953657986…87772295355237662719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.243 × 10¹⁰⁶(107-digit number)
12431700432790731597…75544590710475325439
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,783,114 XPM·at block #6,817,383 · 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