Block #346,046

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2014, 8:04:23 AM · Difficulty 10.2162 · 6,462,201 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d96a3804d689747fe0c5bc14b4d110057524930a4c6db19f660d845eac87882

Height

#346,046

Difficulty

10.216211

Transactions

25

Size

26.46 KB

Version

2

Bits

0a375994

Nonce

256,056

Timestamp

1/6/2014, 8:04:23 AM

Confirmations

6,462,201

Merkle Root

0d33ca291054a960fb09f5b482e738f99de99d49d2647b88a922b1b039b0d7c3
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.136 × 10¹⁰³(104-digit number)
11360076080613581142…93970584272941299199
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.136 × 10¹⁰³(104-digit number)
11360076080613581142…93970584272941299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.272 × 10¹⁰³(104-digit number)
22720152161227162284…87941168545882598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.544 × 10¹⁰³(104-digit number)
45440304322454324568…75882337091765196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.088 × 10¹⁰³(104-digit number)
90880608644908649137…51764674183530393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.817 × 10¹⁰⁴(105-digit number)
18176121728981729827…03529348367060787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.635 × 10¹⁰⁴(105-digit number)
36352243457963459654…07058696734121574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.270 × 10¹⁰⁴(105-digit number)
72704486915926919309…14117393468243148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.454 × 10¹⁰⁵(106-digit number)
14540897383185383861…28234786936486297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.908 × 10¹⁰⁵(106-digit number)
29081794766370767723…56469573872972595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.816 × 10¹⁰⁵(106-digit number)
58163589532741535447…12939147745945190399
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,710,024 XPM·at block #6,808,246 · 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