Block #360,833

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 4:45:29 PM · Difficulty 10.3991 · 6,455,976 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
46afd422aefc0adb98ccacb44144e500ce755bb91038cb0a4045c66271ae4ca1

Height

#360,833

Difficulty

10.399137

Transactions

8

Size

3.80 KB

Version

2

Bits

0a662ddd

Nonce

61,528

Timestamp

1/15/2014, 4:45:29 PM

Confirmations

6,455,976

Merkle Root

e25de4bc3e3548e158cfacbb2dccd4cf9f78f97dd1b0578058615a4b3d20d9dc
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.194 × 10¹⁰⁷(108-digit number)
11946197179216156762…33222775651819407999
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.194 × 10¹⁰⁷(108-digit number)
11946197179216156762…33222775651819407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.389 × 10¹⁰⁷(108-digit number)
23892394358432313525…66445551303638815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.778 × 10¹⁰⁷(108-digit number)
47784788716864627050…32891102607277631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.556 × 10¹⁰⁷(108-digit number)
95569577433729254101…65782205214555263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.911 × 10¹⁰⁸(109-digit number)
19113915486745850820…31564410429110527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.822 × 10¹⁰⁸(109-digit number)
38227830973491701640…63128820858221055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.645 × 10¹⁰⁸(109-digit number)
76455661946983403281…26257641716442111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.529 × 10¹⁰⁹(110-digit number)
15291132389396680656…52515283432884223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.058 × 10¹⁰⁹(110-digit number)
30582264778793361312…05030566865768447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.116 × 10¹⁰⁹(110-digit number)
61164529557586722624…10061133731536895999
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,778,509 XPM·at block #6,816,808 · 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