SQLmap finds injectable ‘id’ parameter but the response is ‘Internal Server Error’

I am trying to understand the SQLi so I ran SQLMap with ‘-vvv’ parameter

4: Show also HTTP requests.

I did scan one of the vulnerable and ‘free to hack’ sites. In one of the requests sent, the response from SQLmap was:

[22:25:10] [DEBUG] got HTTP error code: 500 (‘Internal Server Error’)

[22:25:10] [INFO] GET parameter ‘id’ appears to be ‘AND boolean-based blind – WHERE or HAVING clause’ injectable (with –code=200)

I tried to use same payload GET /showforum.asp?id=1%20AND%20%28SELECT%20CHR%28116%29%7C%7CCHR%28100%29%7C%7CCHR%2885%29%7C%7CCHR%28111%29%20FROM%20SYSIBM.SYSDUMMY1%29%3D%27tdUo%27 in Burp but it keeps throwing me 500 error.

Can someone explain me how did excatly SQLmap come to this conclusion that parameter ID is injectable, while there was an error? I tried to compare different 500 error responses, but no difference between this specific payload ant other ones.

Any answer will be appreciated, thanks.

Why does DFS in Dinic’s Algorithm finds a blocking flow

I came upon this implementation of the dfs in Dinic’s algorithm written in Python

def dfs(c, f, current, capacity):   tmp = capacity # What's the purpose of that?    # we want to get to the sink, but we want it to be a blocking flow path   if current == NROW - 1:     return capacity    for i in range(NROW):     is_next = levels[i] == levels[current] + 1     residual_capacity = c[current][i] - f[current][i]     has_more_capacity = residual_capacity > 0     if is_next and has_more_capacity:       min_capacity_so_far = min(tmp, residual_capacity)       flow = dfs(c, f, i, min_capacity_so_far)       f[current][i] += flow       f[i][current] -= flow       tmp -= flow # Why do we do that   return capacity - tmp # Why do we return capacity - tmp 

How do we know that this dfs finds a blocking path? Also, I can’t seem to understand the usage of the temp variable.

Thanks in advance!

Is There Any Shortest Path Algorithm That Finds The Shortest Path Between Only Two Nodes

The Dikstra shortest path algorithm on a weighted graph, directional or bidirectional, pretty quick. There is also the Bellman Ford algorithm. However, these two find the shortest path between one source to all vertices. However, if I only want to know the path between two vertices, is there a faster algorithm that only finds the distance between two nodes?

algorithm that finds minimal vertex cover of a given vertex

i am looking for a simple algorithm that gets as an input an undirected graph and a vertex in the graph and outputs the minimal vertex cover that v belongs to.

not sure on how to do it correctly, here’s my attempt:

for a given undirected graph $ G=(V,E)$ and a vertex $ v \in G$

1)$ edges \leftarrow \emptyset $

2)remove adjacent edges to given vertex v(given in the input)

3)while there are edges in graph G:

3.1)$ edges \leftarrow {u,v}$

3.2)$ G\:\leftarrow \:G\:\:\ \:\:\left\{u,v\right\}$ (doesn’t let me mark it correctly, but i meant remove {u,v} from G. doesn’t give me to write \ correctly

3.3)return |x|+1 (including v we got from the input)

how to make it better? would appreciate seeing better algorithms for this and explanations/insights so i can learn

thank you for your efforts

The Apprentice Finds a Master’s Spellbook?

In 5e D&D, can a wizard discern and copy a wizard spell into their spellbook that they aren’t high enough level to cast? If they found a dead archmage’s book, or stole their own master’s,prior to fleeing into the night, could a 5th level wizard copy the 9th-level spells into their own? He doesn’t have the spell slots to cast it, obviously, but it beats having to hold onto the book for years; a whole career, waiting to get those vaunted spell slots.

All I find is a money requirement, and a time requirement; it doesn’t even seem like each spellbook has limited space. I’d like to think no, as these more advanced spells are beyond his ken, at present, but I don’t know if there is officially an answer. Would he be able to figure out what those higher spells even are? Could he copy them into his book, with the money, and the time? It seems like in Dragon Heist, you COULD find a certain archmage’s tome, steal it, copy it, and eventually still trade it, unharmed, for profit to an interested party; basically getting twice the value out if an already valuable thing. Thanks much!

In 18.04 gnome-control-center finds bluetooth using default desktop, but not with fvwm

When I run gnome-control-center -v bluetooth using the Ubuntu desktop manager, things work correctly and I see Bluetooth is available and powered. When I run it using my preferred fvwm desktop manager, I’m told No Bluetooth available. Does anybody have any suggestions as to why this might be, and, even better, how to fix it? Thanks for any advice!

installed scanimage and newly compiled sane-find-scanner finds scanner but newly compiled scanimage does not

I have compiled from the latest source.

The pre-installed scanimage in /usr/bin works fine, but the version I just compiled does not detect the scanner, even when run as root from the compilation directory, e.g. frontend/scanimage. I have compiled with the proper driver that I need, and when I run frontend/sane-find-scanner from the compilation directory it finds the scnaner.

I don’t want to install this version because I am just doing some testing, but I am concerned whether this could be the reason for the failure.