Block #379,076

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2014, 7:28:26 AM · Difficulty 10.4144 · 6,436,005 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8a3709739873e3e3591f49071a9ed2d9677cedbc76013f6ac7e129677a7af305

Height

#379,076

Difficulty

10.414415

Transactions

14

Size

4.30 KB

Version

2

Bits

0a6a1713

Nonce

21,113

Timestamp

1/28/2014, 7:28:26 AM

Confirmations

6,436,005

Merkle Root

11cb401675b720869d2cf1e456d53dc442180a2cef075a9c143a0cedb320e639
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.

8.029 × 10⁹⁸(99-digit number)
80292145240308383912…14649475557933050879
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
8.029 × 10⁹⁸(99-digit number)
80292145240308383912…14649475557933050879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.605 × 10⁹⁹(100-digit number)
16058429048061676782…29298951115866101759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.211 × 10⁹⁹(100-digit number)
32116858096123353564…58597902231732203519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.423 × 10⁹⁹(100-digit number)
64233716192246707129…17195804463464407039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.284 × 10¹⁰⁰(101-digit number)
12846743238449341425…34391608926928814079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.569 × 10¹⁰⁰(101-digit number)
25693486476898682851…68783217853857628159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.138 × 10¹⁰⁰(101-digit number)
51386972953797365703…37566435707715256319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.027 × 10¹⁰¹(102-digit number)
10277394590759473140…75132871415430512639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.055 × 10¹⁰¹(102-digit number)
20554789181518946281…50265742830861025279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.110 × 10¹⁰¹(102-digit number)
41109578363037892562…00531485661722050559
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,764,734 XPM·at block #6,815,080 · 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