Block #364,991

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 10:59:03 AM · Difficulty 10.4225 · 6,451,460 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
89408f2a820164bc7e4503c82be0c260531b2948f2573f31eb5a299c88fa0b56

Height

#364,991

Difficulty

10.422543

Transactions

3

Size

655 B

Version

2

Bits

0a6c2bc1

Nonce

32,324

Timestamp

1/18/2014, 10:59:03 AM

Confirmations

6,451,460

Merkle Root

8bc49487c54e8bf262741d05b0fe509dafcc0a035296475e6974a1bda6eefa36
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.

6.523 × 10¹⁰⁰(101-digit number)
65233323590689710565…10665265708481497599
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
6.523 × 10¹⁰⁰(101-digit number)
65233323590689710565…10665265708481497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.304 × 10¹⁰¹(102-digit number)
13046664718137942113…21330531416962995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.609 × 10¹⁰¹(102-digit number)
26093329436275884226…42661062833925990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.218 × 10¹⁰¹(102-digit number)
52186658872551768452…85322125667851980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.043 × 10¹⁰²(103-digit number)
10437331774510353690…70644251335703961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.087 × 10¹⁰²(103-digit number)
20874663549020707380…41288502671407923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.174 × 10¹⁰²(103-digit number)
41749327098041414761…82577005342815846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.349 × 10¹⁰²(103-digit number)
83498654196082829523…65154010685631692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.669 × 10¹⁰³(104-digit number)
16699730839216565904…30308021371263385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.339 × 10¹⁰³(104-digit number)
33399461678433131809…60616042742526771199
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,775,734 XPM·at block #6,816,450 · 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