Block #339,558

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2014, 5:06:29 AM · Difficulty 10.1242 · 6,490,797 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
854644fab3f82151b9eb73441105d1c8e39b93db648c6c42f820ca1ada64fe81

Height

#339,558

Difficulty

10.124188

Transactions

8

Size

10.58 KB

Version

2

Bits

0a1fcac6

Nonce

85,249

Timestamp

1/2/2014, 5:06:29 AM

Confirmations

6,490,797

Merkle Root

6df1b880b37607505226e677651312e72981718737295e993d48296afe604e51
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.070 × 10⁹⁷(98-digit number)
60705793327957136741…30571158044865534079
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.070 × 10⁹⁷(98-digit number)
60705793327957136741…30571158044865534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.214 × 10⁹⁸(99-digit number)
12141158665591427348…61142316089731068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.428 × 10⁹⁸(99-digit number)
24282317331182854696…22284632179462136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.856 × 10⁹⁸(99-digit number)
48564634662365709392…44569264358924272639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.712 × 10⁹⁸(99-digit number)
97129269324731418785…89138528717848545279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.942 × 10⁹⁹(100-digit number)
19425853864946283757…78277057435697090559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.885 × 10⁹⁹(100-digit number)
38851707729892567514…56554114871394181119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.770 × 10⁹⁹(100-digit number)
77703415459785135028…13108229742788362239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.554 × 10¹⁰⁰(101-digit number)
15540683091957027005…26216459485576724479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.108 × 10¹⁰⁰(101-digit number)
31081366183914054011…52432918971153448959
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,887,082 XPM·at block #6,830,354 · 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