Block #537,979

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/12/2014, 3:31:55 AM · Difficulty 10.9185 · 6,278,801 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5051c60c7ade2e67451eab74f484cc9b5ac704e37295008c2a6c315b638aeb27

Height

#537,979

Difficulty

10.918535

Transactions

9

Size

2.55 KB

Version

2

Bits

0aeb251c

Nonce

6,323

Timestamp

5/12/2014, 3:31:55 AM

Confirmations

6,278,801

Merkle Root

d775f3d3d6fc0ae447cca469afa2d4f140b336563cb87a0c3d246713d189d96a
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.746 × 10¹⁰⁰(101-digit number)
17463610755542669197…66915561177058559999
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.746 × 10¹⁰⁰(101-digit number)
17463610755542669197…66915561177058559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.492 × 10¹⁰⁰(101-digit number)
34927221511085338395…33831122354117119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.985 × 10¹⁰⁰(101-digit number)
69854443022170676790…67662244708234239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.397 × 10¹⁰¹(102-digit number)
13970888604434135358…35324489416468479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.794 × 10¹⁰¹(102-digit number)
27941777208868270716…70648978832936959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.588 × 10¹⁰¹(102-digit number)
55883554417736541432…41297957665873919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.117 × 10¹⁰²(103-digit number)
11176710883547308286…82595915331747839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.235 × 10¹⁰²(103-digit number)
22353421767094616572…65191830663495679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.470 × 10¹⁰²(103-digit number)
44706843534189233145…30383661326991359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.941 × 10¹⁰²(103-digit number)
89413687068378466291…60767322653982719999
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,275 XPM·at block #6,816,779 · 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