Block #379,270

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2014, 10:31:01 AM · Difficulty 10.4159 · 6,434,825 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4f571d53ed1e5d9f3a06782591cee6fafcaebd0f464430721411262898e6e04c

Height

#379,270

Difficulty

10.415908

Transactions

7

Size

1.53 KB

Version

2

Bits

0a6a78f0

Nonce

4,171

Timestamp

1/28/2014, 10:31:01 AM

Confirmations

6,434,825

Merkle Root

7641de3905b00b47e3da3f79c08bf5e93fb428a6234394f157b1bb067e3f88fb
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.114 × 10⁹⁵(96-digit number)
11148829262593953557…79662259957344199919
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.114 × 10⁹⁵(96-digit number)
11148829262593953557…79662259957344199919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.229 × 10⁹⁵(96-digit number)
22297658525187907115…59324519914688399839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.459 × 10⁹⁵(96-digit number)
44595317050375814230…18649039829376799679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.919 × 10⁹⁵(96-digit number)
89190634100751628460…37298079658753599359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.783 × 10⁹⁶(97-digit number)
17838126820150325692…74596159317507198719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.567 × 10⁹⁶(97-digit number)
35676253640300651384…49192318635014397439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.135 × 10⁹⁶(97-digit number)
71352507280601302768…98384637270028794879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.427 × 10⁹⁷(98-digit number)
14270501456120260553…96769274540057589759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.854 × 10⁹⁷(98-digit number)
28541002912240521107…93538549080115179519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.708 × 10⁹⁷(98-digit number)
57082005824481042214…87077098160230359039
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,756,842 XPM·at block #6,814,094 · 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