Block #355,190

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 11:50:29 PM · Difficulty 10.3588 · 6,458,734 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
93fda64c80e65abc988708dd66201a6dc1ce25ce57fcdae212dcc64281f3ce36

Height

#355,190

Difficulty

10.358779

Transactions

5

Size

2.12 KB

Version

2

Bits

0a5bd8f4

Nonce

125,022

Timestamp

1/11/2014, 11:50:29 PM

Confirmations

6,458,734

Merkle Root

71ebd82055a688a9bcb130e41dabe6e82f421a66d1a77e63ba05113e3563ec1b
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.315 × 10¹⁰³(104-digit number)
33154870208254054124…66637998714583766079
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.315 × 10¹⁰³(104-digit number)
33154870208254054124…66637998714583766079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.630 × 10¹⁰³(104-digit number)
66309740416508108249…33275997429167532159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.326 × 10¹⁰⁴(105-digit number)
13261948083301621649…66551994858335064319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.652 × 10¹⁰⁴(105-digit number)
26523896166603243299…33103989716670128639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.304 × 10¹⁰⁴(105-digit number)
53047792333206486599…66207979433340257279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.060 × 10¹⁰⁵(106-digit number)
10609558466641297319…32415958866680514559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.121 × 10¹⁰⁵(106-digit number)
21219116933282594639…64831917733361029119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.243 × 10¹⁰⁵(106-digit number)
42438233866565189279…29663835466722058239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.487 × 10¹⁰⁵(106-digit number)
84876467733130378559…59327670933444116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.697 × 10¹⁰⁶(107-digit number)
16975293546626075711…18655341866888232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.395 × 10¹⁰⁶(107-digit number)
33950587093252151423…37310683733776465919
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,755,466 XPM·at block #6,813,923 · 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