I mean, the simplest answer is to lay a new cable, and that is definitely what I am going to do - that’s not my question.
But this is a long run, and it would be neat if I could salvage some of that cable. How can I discover where the cable is damaged?
One stupid solution would be to halve the cable and crimp each end, and then test each new cable. Repeat iteratively. I would end up with a few broken cables and a bunch of tested cables, but they might be short.
How do the pro’s do this? (Short of throwing the whole thing away!)
If you just want some spare cable. I’d make 5x 20M pieces. The one that doesn’t work becomes 2x 10M. That bad one becomes 2x 5M … As far down as you like.
Isn’t that almost what they suggested except starting at a different size and doing a binary search basically? You’re just starting the binary search after the first step of cutting into 5 lengths instead of 2.
You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !selfhosted@lemmy.world
A place to share alternatives to popular online services that can be self-hosted without giving up privacy or locking you into a service you don’t control.
Rules:
Be civil: we’re here to support and learn from one another. Insults won’t be tolerated. Flame wars are frowned upon.
No spam posting.
Posts have to be centered around self-hosting. There are other communities for discussing hardware or home computing. If it’s not obvious why your post topic revolves around selfhosting, please include details to make it clear.
Don’t duplicate the full text of your blog or github here. Just post the link for folks to click.
Submission headline should match the article title (don’t cherry-pick information from the title to fit your agenda).
No trolling.
Resources:
selfh.st Newsletter and index of selfhosted software and apps
If you just want some spare cable. I’d make 5x 20M pieces. The one that doesn’t work becomes 2x 10M. That bad one becomes 2x 5M … As far down as you like.
Isn’t that almost what they suggested except starting at a different size and doing a binary search basically? You’re just starting the binary search after the first step of cutting into 5 lengths instead of 2.