Block #360,299

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 9:03:18 AM · Difficulty 10.3907 · 6,446,540 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c94e9c146824472817e2e6b4a4d7c39722ec510ba43b2fdc92c489b9a1ecb615

Height

#360,299

Difficulty

10.390654

Transactions

4

Size

2.22 KB

Version

2

Bits

0a6401ec

Nonce

5,968

Timestamp

1/15/2014, 9:03:18 AM

Confirmations

6,446,540

Merkle Root

59a84a051fc1f2b2254dfa02765ed971ae9bc670c6fb436819712247122b2510
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.747 × 10⁹⁸(99-digit number)
17474123177242885811…14045490032251104199
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.747 × 10⁹⁸(99-digit number)
17474123177242885811…14045490032251104199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.494 × 10⁹⁸(99-digit number)
34948246354485771622…28090980064502208399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.989 × 10⁹⁸(99-digit number)
69896492708971543244…56181960129004416799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.397 × 10⁹⁹(100-digit number)
13979298541794308648…12363920258008833599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.795 × 10⁹⁹(100-digit number)
27958597083588617297…24727840516017667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.591 × 10⁹⁹(100-digit number)
55917194167177234595…49455681032035334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.118 × 10¹⁰⁰(101-digit number)
11183438833435446919…98911362064070668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.236 × 10¹⁰⁰(101-digit number)
22366877666870893838…97822724128141337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.473 × 10¹⁰⁰(101-digit number)
44733755333741787676…95645448256282675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.946 × 10¹⁰⁰(101-digit number)
89467510667483575353…91290896512565350399
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,698,815 XPM·at block #6,806,838 · 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.

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