Block #346,270

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2014, 11:01:56 AM · Difficulty 10.2234 · 6,480,742 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
926e204ff2063fecb5ecd38012296e7a60bf26c75c0f60de517dc1e375cae3df

Height

#346,270

Difficulty

10.223412

Transactions

3

Size

1.07 KB

Version

2

Bits

0a393185

Nonce

6,388

Timestamp

1/6/2014, 11:01:56 AM

Confirmations

6,480,742

Merkle Root

e8aff0a6c64904b51339691057d322997c1f486fe7905dc1a50784e20d8345a9
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.904 × 10⁹⁷(98-digit number)
19040072388585176476…78112498261109571399
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.904 × 10⁹⁷(98-digit number)
19040072388585176476…78112498261109571399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.808 × 10⁹⁷(98-digit number)
38080144777170352953…56224996522219142799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.616 × 10⁹⁷(98-digit number)
76160289554340705906…12449993044438285599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.523 × 10⁹⁸(99-digit number)
15232057910868141181…24899986088876571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.046 × 10⁹⁸(99-digit number)
30464115821736282362…49799972177753142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.092 × 10⁹⁸(99-digit number)
60928231643472564725…99599944355506284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.218 × 10⁹⁹(100-digit number)
12185646328694512945…99199888711012569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.437 × 10⁹⁹(100-digit number)
24371292657389025890…98399777422025139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.874 × 10⁹⁹(100-digit number)
48742585314778051780…96799554844050278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.748 × 10⁹⁹(100-digit number)
97485170629556103560…93599109688100556799
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,860,273 XPM·at block #6,827,011 · 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